Izvestiya of Saratov University.

Mathematics. Mechanics. Informatics

ISSN 1816-9791 (Print)

ISSN 2541-9005 (Online)

graph

On a concrete characterization problem of universal graphic semiautomata

Generation of colored graphs with isomorphism rejection

T-irreducible extension for union of paths and cycles

T-irreducible Extensions for Starlike Trees

About Reconstruction of Small Tournaments

On Definability of Universal Graphic Automata by Their Input Symbol Semigroups

The Study of the Statistical Characteristics of the Text Based on the Graph Model of the Linguistic Corpus