The size of power automata

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 371-386

  Sutner, K ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Cellular automata; Deterministic automata; State complexity; Transitive semiautomata

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; SET THEORY;

CELLULAR AUTOMATA;

FINITE AUTOMATA;

EID: 0037463538     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00413-9     Document Type: Conference Paper

References (27)

1. M.-P. Beal, D. Perrin, Symbolic dynamics and finite automata, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 2, Springer, Berlin, 1997 (Chapter 10).
2. Beauquier D. Minimal automaton for a factorial, transitive, rational language. Theoret. Comput. Sci. 67:1989;65-73.
3. Birget J.C. Intersection and union of regular languages and state-complexity. Inform. Process. Lett. 43(4):1992;185-190.
4. Birget J.C. Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci. 119:1993;267-291.
5. J.A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, in: J. Fox (Ed.), Mathematical Theory of Automata, Vol. 12, MRI Symposia Series, Polytechnic Press, Polytechnic Institute Brooklyn, 1963, pp. 529-561.
6. Delorme M., Mazoyer J. Cellular Automata: A Parallel Model. Mathematics and its Applications. Vol. 460:1999;Kluwer Academic Publishers, Dordrecht.
7. Fischer R. Sofic systems and graphs. Monatsh. Math. 80:1975;179-186.
8. Garey M.R., Johnson D.S. Computers and Intractability. 1979;Freeman, New York.
9. Hedlund G.A. Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory. 3:1969;320-375.
10. D. Kozen, Lower bounds for natural proof systems, in: Proc. 18th Ann. Symp. on Foundations of Computer Science, IEEE Computer Society, 1977, pp. 254-266.
11. Leung Hing Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4):1998;1073-1082.
12. Lind D., Marcus B. Introduction to Symbolic Dynamics and Coding. 1995;Cambridge University Press, Cambridge.
13. Pin J.E. Varieties of Formal Languages, Foundations of Computer Science. 1986;Plenum Publishing Corporation, New York.
14. B. Ravikumar, Private communication, 1994.
15. W. Sakoda, M. Sipser, Non-determinism and the size of two-way automata, in: Proc. 10th ACM Symp. on Theory of Computing, 1978, pp. 275-286.
16. Salomaa A. On the composition of functions of several variables ranging over a finite set. Ann. Univ. Turku. Ser. A1. 41:1960;48-57.
17. A. Salomaa, Many-valued truth functions, ĉerný's conjecture and road coloring, Bull. EATCS (68) (1999) 134-150.
18. Sutner K. De Bruijn graphs and linear cellular automata. Complex Systems. 5(1):1991;19-30.
19. Sutner K. Linear cellular automata and Fischer automata. Parallel Comput. 23(11):1997;1613-1634.
20. K. Sutner, Linear Cellular Automata and De Bruijn Automata, Mathematics and its Applications, Vol. 460, Kluwer Academic Publisher, Dordrecht, 1999, pp. 303-320.
21. K. Sutner, Reduced power automata, 2002, in preparation.
22. Trakhtenbrot R.A., Barzdin Y.M. Finite Automata: Behavior and Synthesis. 1973;North-Holland, Amsterdam.
23. Vorobev N. On symmetric associative systems. Leningrad Gos. Ped. Inst. Uchen. Zap. 89:1953;161-166.
24. Weiss B. Subshifts of finite type and sofic systems. Monatsh. Math. 77:1973;462-474.
25. Wolfram S. Twenty problems in the theory of cellular automata. Phys. Scripta. T9:1985;170-183.
26. Wolfram S. Theory and Applications of Cellular Automata. 1986;World Scientific, Singapore.
27. Sheng Yu, Regular languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1997 (Chapter 2).