Graph automataBOZAPALIDIS, Symeon; KALAMPAKAS, Antonios.Theoretical computer science. 2008, Vol 393, Num 1-3, pp 147-165, issn 0304-3975, 19 p.Article

AUTOMATENGRAPHEN UND IHRE ANALYTISCHE BEHANDLUNG = GRAPHES D'AUTOMATE ET LEUR TRAITEMENT ANALYTIQUEBOCHMANN D; SIMON FU.1979; WISSENSCHAFTL. Z. TECH. HOCHSCH. KARL-MARX-STADT; ISSN 0372-7610; DDR; DA. 1979; VOL. 21; NO 6; PP. 675-684; BIBL. 10 REF.Article

Setting port numbers for fast graph explorationILCINKAS, David.Theoretical computer science. 2008, Vol 401, Num 1-3, pp 236-242, issn 0304-3975, 7 p.Article

On size reduction techniques for multitape automataTAMM, Hellis; NYKÄNEN, Matti; UKKONEN, Esko et al.Theoretical computer science. 2006, Vol 363, Num 2, pp 234-246, issn 0304-3975, 13 p.Article

Generalising automaticity to modal properties of finite structuresDAWAR, Anuj; KREUTZER, Stephan.Theoretical computer science. 2007, Vol 379, Num 1-2, pp 266-285, issn 0304-3975, 20 p.Article

Tiling problems, automata, and tiling graphsBENEDETTO, Katherine P; LOEHR, Nicholas A.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 400-411, issn 0304-3975, 12 p.Article

Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D [log_m D]GRIGORIEFF, Serge.Theoretical computer science. 2006, Vol 356, Num 1-2, pp 170-185, issn 0304-3975, 16 p.Article

Finite graph automata for linear and boundary graph languagesBRANDENBURG, F. J; SKODINIS, K.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 199-232, issn 0304-3975, 34 p.Article

On the reachability of a version of graph-rewriting systemTOMITA, Kohji; KUROKAWA, Haruhisa.Information processing letters. 2009, Vol 109, Num 14, pp 777-782, issn 0020-0190, 6 p.Article

Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitionsHUSS, Wilfried; SAVA, Ecaterina; WOESS, Wolfgang et al.Theoretical computer science. 2010, Vol 411, Num 44-46, pp 3917-3922, issn 0304-3975, 6 p.Article

Recognition of directed acyclic graphs by spanning tree automataFUJIYOSHI, Akio.Theoretical computer science. 2010, Vol 411, Num 38-39, pp 3493-3506, issn 0304-3975, 14 p.Article

A single-copy minimal-time simulation of a torus of automata by a ring of automataMARTIN, Bruno; PEYRAT, Claudine.Discrete applied mathematics. 2007, Vol 155, Num 16, pp 2130-2139, issn 0166-218X, 10 p.Article

Opacity of a finite automaton, method of calculation and the Ising chainYAO, Jia-Yan.Discrete applied mathematics. 2003, Vol 125, Num 2-3, pp 289-318, issn 0166-218X, 30 p.Article