The size of power automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 666-677

  Sutner, Klaus ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BLOW-UP; DETERMINISTIC SIMULATION; PSPACE-COMPLETE;

ARTIFICIAL INTELLIGENCE;

EID: 35248819836     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_58     Document Type: Conference Paper

References (24)

1. M.-P. Beal and D. Perrin. Symbolic dynamics and finite automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 2, chapter 10. Springer Verlag, 1997.
2. D. Beauquier. Minimal automaton for a factorial, transitive, rational language. Theoretical Computer Science, 67:65-73, 1989.
3. W. Brauer. On minimizing finite automata. EATCS Bulletin, 39:113-116, 1988.
4. M. Delorme and J. Mazoyer. Cellular Automata: A Parallel Model, volume 460 of Mathematics and Its Applications. Kluwer Academic Publishers, 1999.
5. R. Fischer. Sofic systems and graphs. Monatshefte für Mathematik, 80:179-186, 1975.
6. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979.
7. E. Goles, A. Maass, and S. Martinez. On the limit set of some universal cellular automata. Theoretical Computer Science, 110:53-78, 1993.
8. J. E. Hanson and J. P. Crutchfield. Computational mechanics of cellular automata. Technical Report 95-10-095, Santa Fe Institute, 1995.
9. G. A. Hedlund. Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory, 3:320-375, 1969..
10. L. Hurd. Formal language characterizations of cellular automata limit sets. Complex Systems, 1(1):69-80, 1987.
11. D. Kozen. Lower bounds for natural proof systems. In Proc. 18-th Ann. Symp. on Foundations of Computer Science, pages 254-266. IEEE Computer Society, 1977.
12. D. Lind and B. Marcus. Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995.
13. J. E. Pin. Varieties of Formal Languages. Foundations of Computer Science. Plenum Publishing Corporation, 1986.
14. B. Ravikumar. Private communication, 1994.
15. A. Salomaa. On the composition of functions of several variables ranging over a finite set. Ann. Univ. Turkuensis, 41, 1960.
16. A. Salomaa. Many-valued truth functions, ĉerný’s conjecture and road coloring. Bulletin EATCS, (68):134-150, June 1999.
17. K. Sutner. Linear cellular automata and Fischer automata. Parallel Computing, 23(11):1613-1634, 1997.
18. K. Sutner. Linear Cellular Automata and De Bruijn Automata, pages 303-320. Volume 460 of Mathematics and Its Applications [4], 1999.
19. R. A. Trakhtenbrot and Y. M. Barzdin. Finite Automata: Behavior and Sythesis. North-Holland, 1973.
20. N. Vorobev. On symmetric associative systems. Leningrad Gos. Ped. Inst., Uch. Zap., 89:161-166, 1953.
21. B. Weiss. Subshifts of finite type and sofic systems. Monatshefte für Mathematik, 77:462-474, 1973.
22. S. Wolfram. Twenty problems in the theory of cellular automata. Physica Scripta, T9:170-183, 1985.
23. S. Wolfram. Theory and Applications of Cellular Automata. World Scientific, 1986.
24. Sheng Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 2. Springer Verlag, 1997.