Limited automata and regular languages

International Journal of Foundations of Computer Science

Volumn 25, Issue 7, 2014, Pages 897-916

  Pighizzini, Giovanni ^a   Pisoni, Andrea ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

context free languages; descriptional complexity; Finite automata; formal languages; regular languages; Turing machines

Indexed keywords

EID: 84929301543     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054114400140     Document Type: Article

References (18)

1. J.-C. Birget, Intersection and union of regular languages and state complexity, Information Processing Letters 43(4) (1992) 185-190.
2. J.-C. Birget, State-complexity of finite-state devices, state compressibility and incompressibility, Mathematical Systems Theory 26(3) (1993) 237-269.
3. N. Chomsky and M. Schützenberger, The algebraic theory of context-free languages, Computer Programming and Formal Systems, eds. P. Braffort and D. Hirschberg, Studies in Logic and the Foundations of Mathematics 35 (Elsevier, 1963), pp. 118-161.
4. M. Chrobak, Finite automata and unary languages, Theor. Comput. Sci. 47(3) (1986) 149-158
5. F. C. Hennie, One-tape, off-line Turing machine computations, Information and Control 8(6) (1965) 553-578.
6. T. N. Hibbard, A generalization of context-free determinism, Information and Control 11(1/2) (1967) 196-238.
7. M. Holzer and M. Kutrib, Descriptional and computational complexity of finite automata - A survey, Inf. Comput. 209(3) (2011) 456-470.
8. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, 1979).
9. C. Mereghetti and G. Pighizzini, Two-way automata simulations and unary languages, Journal of Automata, Languages and Combinatorics 5(3) (2000) 287-300.
10. C. Mereghetti and G. Pighizzini, Optimal simulations between unary automata, SIAM J. Comput. 30(6) (2001) 1976-1992.
11. A. Okhotin, Non-erasing variants of the Chomsky-Schützenberger Theorem, Developments in Language Theory, eds. H.-C. Yen and O. H. Ibarra Lecture Notes in Computer Science 7410 (Springer, 2012), pp. 121-129.
12. G. Pighizzini, Nondeterministic one-tape off-line Turing machines, Journal of Automata, Languages and Combinatorics 14(1) (2009) 107-124.
13. G. Pighizzini and A. Pisoni, Limited automata and context-free languages, NCMA, eds. S. Bensch, F. Drewes, R. Freund and F. Otto books@ocg.at 294 (Österreichische Computer Gesellschaft, 2013), pp. 209-223.
14. W. J. Sakoda and M. Sipser, Nondeterminism and the size of two-way finite automata, STOC, eds. R. J. Lipton, W. A. Burkhard, W. J. Savitch, E. P. Friedman and A. V. Aho (ACM, 1978), pp. 275-286.
15. J. O. Shallit, A Second Course in Formal Languages and Automata Theory (Cambridge University Press, 2008).
16. J. C. Shepherdson, The reduction of two-way automata to one-way automata, IBM J. Res. Dev. 3(2) (1959) 198-200.
17. K. W. Wagner and G. Wechsung, Computational Complexity (D. Reidel Publishing Company, Dordrecht, 1986).
18. S. Yu, State complexity of regular languages, Journal of Automata, Languages and Combinatorics 6(2) (2001) 221-234.