Limited automata and context-free languages

Fundamenta Informaticae

Volumn 136, Issue 1-2, 2015, Pages 157-176

  Pighizzini, Giovanni ^a   Pisoni, Andrea ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

descriptional complexity; deterministic context free languages; finite automata; formal languages; Turing machines

Indexed keywords

COMPUTATIONAL LINGUISTICS; FINITE AUTOMATA; FORMAL LANGUAGES; MACHINERY; TURING MACHINES;

DESCRIPTIONAL COMPLEXITY; DETERMINISTIC PUSHDOWN AUTOMATA; DETERMINISTIC-CONTEXT-FREE-LANGUAGES; DOUBLE EXPONENTIAL; POLYNOMIAL SIZE; PUSH-DOWN AUTOMATA; RELATIVE SIZES; UPPER AND LOWER BOUNDS;

CONTEXT FREE LANGUAGES;

EID: 84922764018     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2015-1148     Document Type: Article

References (11)

1. Blum, N., Koch, R.: Greibach Normal Form Transformation Revisited, Information and Computation, 150(1), 1999, 112-118, ISSN 0890-5401.
2. Chomsky, N., Schützenberger, M.: The Algebraic Theory of Context-Free Languages, in: Computer Programming and Formal Systems (P. Braffort, D. Hirschberg, Eds.), vol. 35 of Studies in Logic and the Foundations of Mathematics, Elsevier, 1963, 118-161.
3. Goldstine, J., Kappes, M., Kintala, C. M. R., Leung, H., Malcher, A., Wotschke, D.: Descriptional Complexity of Machines with Limited Resources, J. UCS, 8(2), 2002, 193-234.
4. Harrison, M. A.: Introduction to Formal Language Theory, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1978, ISBN 0201029553.
5. Hibbard, T. N.: A Generalization of Context-Free Determinism, Information and Control, 11(1/2), 1967, 196-238.
6. Holzer, M., Kutrib, M.: Descriptional Complexity - An Introductory Survey, in: Scientific Applications of Language Methods, chapter 1, Imperial College Press, 2010, 1-58.
7. Hopcroft, J. E., Ullman, J. D.: Introduction to Automata Theory, Languages and Computation, Addison- Wesley, 1979.
8. Pighizzini, G., Pisoni, A.: Limited Automata and Regular Languages, in: Descriptional Complexity of Formal Systems (H. Jürgensen, R. Reis, Eds.), vol. 8031 of Lecture Notes in Computer Science, Springer, 2013, 253-264, An extended version will appear on the International Journal of Foundations of Computer Science.
9. Pighizzini, G., Shallit, J., Wang, M.: Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds, J. Computer and System Sciences, 65(2), 2002, 393-414.
10. Shallit, J. O.: A Second Course in Formal Languages and Automata Theory, Cambridge University Press, 2008.
11. Wagner, K.W.,Wechsung, G.: Computational Complexity, D. Reidel Publishing Company, Dordrecht, 1986.