Abstract
In this paper a new family of stateless (non-deterministic) pushdown automata are used to accept languages of the Chomsky hierarchy. Having only a stack with at most 1 symbol the regular languages can be recognized. The usual pushdown automata accept the context-free languages. The extended version which uses additional half-translucent shadow symbols accept the context-sensitive languages. Finally, allowing a kind of λ-transitions the automata accept any recursively enumerable languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Černý, A.: Description of words by cellular automata. Kuwait Journal of Science & Engineering 24, 199–215 (1997)
Geffert, V., Mereghetti, C., Palano, B.: More Concise Representation of Regular Languages by Automata and Regular Expressions. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 359–370. Springer, Heidelberg (2008)
Gray, J.N., Harrison, M.A., Ibarra, O.H.: Two-way pushdown automata. Information and Control 11, 30–70 (1967)
Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Information and Computation 138, 160–169 (1997)
Maslov, A.N.: Multilevel stack automata. Prob. Inf. Transmiss. 12, 38–42 (1976)
Meduna, A.: Deep pushdown automata. Acta Informatica 42, 541–552 (2006)
Morvan, C., Rispal, C.: Families of automata characterizing context-sensitive languages. Acta Informatica 41, 293–314 (2005)
Nagy, B.: Derivation trees for context-sensitive grammars. In: Ito, M., Kobayashi, Y., Shoji, K. (eds.) International Workshop on Automata, Formal Languages and Algebraic Systems (AFLAS 2008), Kyoto, Japan. World Scientific, Singapore (to appear, 2010)
Nagy, B., Varga, P.: A New Normal Form for Context-Sensitive Grammars. In: SOFSEM 2009, vol. II, pp. 60–71 (2009)
Penttonen, M.: One-sided and two-sided context in formal grammars. Information and Control 25, 371–392 (1974)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagy, B. (2010). An Automata-Theoretic Characterization of the Chomsky-Hierarchy. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-13562-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13561-3
Online ISBN: 978-3-642-13562-0
eBook Packages: Computer ScienceComputer Science (R0)