Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds

Journal of Computer and System Sciences

Volumn 65, Issue 2, 2002, Pages 393-414

  Pighizzini, Giovanni ^a   Shallit, Jeffrey ^b   Wang, Ming Wei ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Context free grammars; Descriptional complexity; Formal languages; Pushdown automata; Space complexity

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FINITE AUTOMATA; FORMAL LANGUAGES; FUNCTIONS; MATHEMATICAL MODELS;

DESCRIPTIONAL COMPLEXITY; PUSHDOWN AUTOMATA; SPACE COMPLEXITY; UNARY LANGUAGES;

CONTEXT FREE GRAMMARS;

EID: 23844551254     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1855     Document Type: Article

References (25)

1. M. Alberts, Space complexity of alternating Turing machines, in "Proceedings of the FCT '85," Lecture Notes in Computer Science, Vol. 199, pp. 1-7, Springer-Verlag, Berlin, 1985.
2. A. Bertoni, C. Mereghetti, and G. Pighizzini, Strong optimal lower bounds for Turing machines that accept nonregular languages, in "Proceedings of the MFCS '95," Lecture Notes in Computer Science, Vol. 969, pp. 309-318. Springer-Verlag, Berlin, 1995.
3. J.-P. Bézivin, Plus petit commun multiple des termes consécutifs d'une suite réccurente linéaire, Collect. Math. 40(1989), 1-11.
4. F. Brandenburg, On one-way auxiliary pushdown automata, in "Proceedings of the 3rd GI Conference," Lecture Notes in Computer Science, Vol. 48, pp. 133-144, Springer, Berlin, 1977.
5. A. Brauer, On a problem of partitions, Amer. J. Math. 64 (1942), 299-312.
6. M. Chrobak, Finite automata and unary languages, Theoret. Comput. Sci. 47 (1986), 149-158.
7. M. Chytil, Almost context-free languages, Fund Inform. IX (1986), 283-322.
8. V. Geffert, Tally version of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space, SIAM J. Comput. 22 (1993), 102-113.
9. V. Geffert, Bridging across the log(n) space frontier, Inform. Comput. 142 (1998), 127-148.
10. V. Geffert, C. Mereghetti, and G. Pighizzini, Sublogarithmic bounds on space and reversals, SIAM J. Comput. 28(1) (1999), 325-340.
11. S. Ginsburg and H. Rice, Two families of languages related to ALG0L, J. A CM 9(3) (1962), 350-371.
12. J. Goldstine, J. Price, and D. Wotschke, A pushdown automaton or a context-free grammar-Which is more economical? Theoret. Comput. Sci. 18 (1982), 33-40.
13. J. Gruska, Descriptional complexity of context-free languages, in "Proceedings of the MFCS "73," pp. 71-83, Mathematical Institute of the Slovak Academy of Sciences, Bratislava, 1973.
14. J. Hopcroft and J. Ullman, Some results on tape-bounded Turing machines, J. ACM 16 (1969), 168-177.
15. J. Hopcroft, R. Motwani, and J. Ullman, "Introduction to Automata Theory, Languages, and Computation," 2nd ed., Addison-Wesley, Reading, MA, 2001.
16. J. Kaneps, Regularity of one-letter languages acceptable by 2-way finite probabilistic automata, in "Proceedings of the FCT "91," Lecture Notes in Computer Science, Vol. 529, pp. 287-296, Springer-Verlag, Berlin, 1991.
17. R.M. Karp, Some bounds on the storage requirements of sequential machines and Turing machines, J. ACM 14(3) (1967), 478-489.
18. C. Mereghetti and G. Pighizzini, Optimal simulations between unary automata, SIAM J. Comput. 30 (2001), 1976-1992.
19. A. Meyer and M. Fischer, Economy of description by automata, grammars, and formal systems, in "Proceedings of the 12th IEEE Symposium on Switching and Automata Theory," pp. 188-191, 1971.
20. R. Parikh, On context-free languages, J. ACM 13 (1966), 570-581.
21. G. Pighizzini and J. Shallit, Unary language operations, state complexity and Jacobsthal's function, Internat. J. Found. Comput. Sci. 13(2002), 145-159.
22. J. Shallit and Y. Breitbart, Automaticity I: Properties of a measure of descriptional complexity, J. Comput. System Sci. 53(1) (1996), 10-25.
23. R. Stearns, J. Hartmanis, and P. Lewis, Hierarchies of memory limited computations, in "IEEE Conference Record on Switching Circuit Theory and Logical Design," pp. 179-190, 1965.
24. A. Szepietowski, "Turing Machines with Sublogarithmic Space," Lecture Notes in Computer Science, Vol. 843, Springer-Verlag, Berlin, 1994.
25. K. Wagner, Do there exist languages with an arbitrary small amount of context-sensitivity? in "Computational Theory and Logic," Lecture Notes in Computer Science, Vol. 270, pp. 427-432, Springer-Verlag, Berlin, 1987.