Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Remila:1994:RGA, author = "Eric Remila", title = "Recognition of graphs by automata", journal = j-THEOR-COMP-SCI, volume = "136", number = "2", pages = "291--332", day = "29", month = dec, year = "1994", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:18:42 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=136&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=136&issue=2&aid=1686", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Lab. LIP-IMAG, Ecole Normale Sup{\'e}rieure de Lyon, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cellular automata; cellular finite automata; graph automata; graph automaton; graph theory; linear algorithm; spanning tree", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }