On the descriptional power of heads, counters, and pebbles

Theoretical Computer Science

Volumn 330, Issue 2, 2005, Pages 311-324

  Kutrib, Martin ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

Descriptional complexity; Finite automata; Non recursive trade offs; State complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SIMULATION; FORMAL LANGUAGES; PROBLEM SOLVING; REAL TIME SYSTEMS; TURING MACHINES;

CELLULAR AUTOMATA; DESCRIPTIONAL COMPLEXITY; NON-RECURSIVE TRADE-OFFS; STATE COMPLEXITY;

FINITE AUTOMATA;

EID: 11844273806     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.04.013     Document Type: Conference Paper

References (29)

1. J.-C. Birget State-complexity of finite-state devices, state compressibility and incompressibility Math. Systems Theory 26 1993 237 269
2. M. Chrobak Finite automata and unary languages Theoret. Comput. Sci. 47 1986 149 158
3. J. Goldstine, M. Kappes, C.M.R. Kintala, H. Leung, A. Malcher, and D. Wotschke Descriptional complexity of machines with limited resources J. Univ. Comput. Sci. 8 2002 193 234
4. J. Hartmanis On non-determinancy in simple computing devices Acta Inform. 1 1972 336 344
5. J. Hartmanis On the succinctness of different representations of languages SIAM J. Comput. 9 1980 114 120
6. J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Language, and Computation 1979 Addison-Wesley Reading, MA
7. J. Hromkovic, and G. Schnitger Nondeterminism versus determinism for two-way finite automata generalizations of Sipser's separation Internat. Coll. Automata, Languages and Programming (ICALP 2003), Lecture Notes in Computer Science vol. 2719 2003 Springer Berlin 439 451
8. K. Inoue, I. Takanami, and H. Taniguchi A note on rebound automata Inform. Sci. 26 1982 87 93
9. H. Leung Tight lower bounds on the size of sweeping automata J. Comput. System Sci. 63 2001 384 393
10. A. Malcher Descriptional complexity of cellular automata and decidability questions J. Autom. Lang. Combin. 7 2002 549 560
11. C. Mereghetti, and G. Pighizzini Two-way automata simulations and unary languages J. Autom. Lang. Combin. 5 2000 287 300
12. C. Mereghetti, and G. Pighizzini Optimal simulations between unary automata SIAM J. Comput. 30 2001 1976 1992
13. A.R. Meyer, M.J. Fischer, Economy of description by automata, grammars, and formal systems, in: IEEE Symp. on Switching and Automata Theory, 1971, pp. 188-191.
14. B. Monien Transformational methods and their application to complexity problems Acta Inform. 6 1976 95 108
15. B. Monien Corrigenda transformational methods and their application to complexity problems Acta Inform. 8 1977 383 384
16. K. Morita, K. Sugata, and H. Umeo Computation complexity of n -bounded counter automaton and multidimensional rebound automaton Systems Comput. Controls 8 1977 80 87
17. H. Petersen, Automata with sensing heads, in: Israel Symposium on the Theory of Computing and Systems, 1995, pp. 150-157.
18. H. Petersen Fooling rebound automata Mathematical Foundations of Computer Science (MFCS 1999), Lecture Notes in Computer Science vol. 1672 1999 Springer Berlin 241 250
19. H. Petersen Separation results for rebound automata Mathematical Foundations of Computer Science (MFCS 2000), Lecture Notes in Computer Science vol. 1893 2000 Springer Berlin 589 598
20. R.W. Ritchie, and F.N. Springsteel Language recognition by marking automata Inform. Control 20 1972 313 330
21. M. Sakamoto, K. Inoue, and I. Takanami A two-way non-deterministic one-counter language not accepted by nondeterminstic rebound automata Trans. IEICE E-73 1990 879 881
22. W. J. Sakoda, M. Sipser, Nondeterminism and the size of two way finite automata, in: ACM Symp. on Theory of Computing (STOC 1978), 1978, pp. 275-286.
23. W.J. Savitch A note on multihead automata and context-sensitive languages Acta Inform. 2 1973 249 252
24. E.M. Schmidt, and T.G. Szymanski Succinctness of descriptions of unambiguous context-free languages SIAM J. Comput. 6 1977 547 553
25. J.I. Seiferas Relating refined space complexity classes J. Comput. System Sci. 14 1977 100 129
26. M. Sipser Halting space-bounded computations Theoret. Comput. Sci. 10 1980 335 338
27. M. Sipser Lower bounds on the size of sweeping automata J. Comput. System Sci. 21 1980 195 202
28. K. Sugata, H. Umeo, and K. Morita The language accepted by a rebound automaton and its computing ability Electron. Comm. Japan 60-A 1977 11 18
29. L.G. Valiant A note on the succinctness of descriptions of deterministic languages Inform. Control 32 1976 139 145