Limited automata and regular languages

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

Volumn 8031 LNCS, Issue , 2013, Pages 253-264

  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

DESCRIPTIONAL COMPLEXITY; DETERMINISTIC FINITE AUTOMATA; DOUBLE EXPONENTIAL; NONDETERMINISTIC FINITE AUTOMATON; UPPER AND LOWER BOUNDS;

CONTEXT FREE LANGUAGES; DISPERSION COMPENSATION; FORMAL LANGUAGES; MACHINERY; TURING MACHINES;

FINITE AUTOMATA;

EID: 84884492230     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39310-5_24     Document Type: Conference Paper

References (16)

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