Skip to main content
SpringerLink
Log in

An Automata-Theoretic Characterization of the Chomsky-Hierarchy

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6108))

  • 805 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Černý, A.: Description of words by cellular automata. Kuwait Journal of Science & Engineering 24, 199–215 (1997)

    MATH  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. Gray, J.N., Harrison, M.A., Ibarra, O.H.: Two-way pushdown automata. Information and Control 11, 30–70 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  5. Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Information and Computation 138, 160–169 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Maslov, A.N.: Multilevel stack automata. Prob. Inf. Transmiss. 12, 38–42 (1976)

    Google Scholar 

  7. Meduna, A.: Deep pushdown automata. Acta Informatica 42, 541–552 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Morvan, C., Rispal, C.: Families of automata characterizing context-sensitive languages. Acta Informatica 41, 293–314 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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)

    Google Scholar 

  10. Nagy, B., Varga, P.: A New Normal Form for Context-Sensitive Grammars. In: SOFSEM 2009, vol. II, pp. 60–71 (2009)

    Google Scholar 

  11. Penttonen, M.: One-sided and two-sided context in formal grammars. Information and Control 25, 371–392 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary

    Benedek Nagy

Authors
  1. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Malostranske nam 25, 11800, Praha 1, Czech Republic

    Jan Kratochvíl , Jiří Fiala  & Petr Kolman ,  & 

  2. State Key Lab. of Computer Science, Institute of Software,, Chinese Academy of Sciences, 100190, Beijing, P.R. China

    Angsheng Li

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation