Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Goles:1993:LSS, author = "Eric Goles and Alejandro Maass and Servet Martinez", title = "On the limit set of some universal cellular automata", journal = j-THEOR-COMP-SCI, volume = "110", number = "1", pages = "53--78", day = "15", month = mar, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:17:02 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=110&issue=1; 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=1993&volume=110&issue=1&aid=1145", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Fac. de Ciencias Fisicas Matematicas, Chile Univ., Santiago, Chile", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic characteristics; associated limit language; cellular automata; complexity; computational complexity; limit set; one-symbol languages; programmable machines; simulation; Turing machine; Turing machines; universal cellular automata", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", }