Advertisement

Formal Language Theory: Basics

  • Alexander Meduna
  • Ondřej Soukup
Chapter

Abstract

This chapter covers the basics of formal language theory. It covers all the notions that are necessary to follow the rest of this book. Apart from the classical rudiments, however, the chapter covers several lesser-known areas of this theory, such as parallel grammars, because these areas are also needed to fully grasp some upcoming topics discussed in this book. The chapter consists of four sections.

Bibliography

  1. [Cho56]
    N. Chomsky, Three models for the description of language. IRE Trans. Inf. Theory 2(3), 113–124 (1956)CrossRefMATHGoogle Scholar
  2. [Cho59]
    N. Chomsky, On certain formal properties of grammars. Inf. Control 2, 137–167 (1959)MathSciNetCrossRefMATHGoogle Scholar
  3. [Chu36a]
    A. Church, A note on the entscheidungsproblem. J. Symb. Log. 1(1), 40–41 (1936)CrossRefMATHGoogle Scholar
  4. [Chu36b]
    A. Church, An unsolvable problem of elementary number. Am. J. Math. 58(2), 345–363 (1936)MathSciNetCrossRefMATHGoogle Scholar
  5. [DP89]
    J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989)CrossRefMATHGoogle Scholar
  6. [GGH67]
    S. Ginsburg, S.A. Greibach, M. Harrison, One-way stack automata. J. ACM 14(2), 389–418 (1967)MathSciNetCrossRefMATHGoogle Scholar
  7. [KM00]
    D. Kolář, A. Meduna, Regulated pushdown automata. Acta Cybernetica 2000(4), 653–664 (2000)MathSciNetMATHGoogle Scholar
  8. [KR83]
    H.C.M. Kleijn, G. Rozenberg, On the generative power of regular pattern grammars. Acta Informatica 20, 391–411 (1983)MathSciNetCrossRefMATHGoogle Scholar
  9. [Mar60]
    A.A. Markov, The theory of algorithms. Am. Math. Soc. Trans. 2(15), 1–14 (1960)MathSciNetMATHGoogle Scholar
  10. [Med00a]
    A. Meduna, Automata and Languages: Theory and Applications (Springer, London, 2000)CrossRefMATHGoogle Scholar
  11. [Med03c]
    A. Meduna, Simultaneously one-turn two-pushdown automata. Int. J. Comput. Math. 2003(80), 679–687 (2003)MathSciNetCrossRefMATHGoogle Scholar
  12. [Med04]
    A. Meduna, Two-way metalinear PC grammar systems and their descriptional complexity. Acta Cybernetica 2004(16), 385–397 (2004)MathSciNetMATHGoogle Scholar
  13. [Med14]
    A. Meduna, Formal Languages and Computation: Models and Their Applications (Taylor & Francis, New York, 2014)MATHGoogle Scholar
  14. [PHHM96b]
    P. Prusinkiewicz, M. Hammel, J. Hanan, R. Měch, L-systems: From the theory to visual models of plants, in Proceedings of the 2nd CSIRO Symposium on Computational Challenges in Life Sciences (CSIRO Publishing, Collingwood, Victoria, Australia, 1996)Google Scholar
  15. [PL90a]
    P. Prusinkiewicz, A. Lindenmayer, The Algorithmic Beauty of Plants (Springer, New York, 1990)CrossRefMATHGoogle Scholar
  16. [Pos43]
    E. Post, Formal reductions of the general combinatorial decision problem. Am. J. Math. 65(2), 197–215 (1943)MathSciNetCrossRefMATHGoogle Scholar
  17. [Rog87]
    H. Rogers, Theory of Recursive Functions and Effective Computability (MIT Press, Cambridge, 1987)MATHGoogle Scholar
  18. [RS80]
    G. Rozenberg, A. Salomaa, Mathematical Theory of L Systems (Academic Press, Orlando, 1980)MATHGoogle Scholar
  19. [RS86]
    G. Rozenberg, A. Salomaa, The Book of L (Springer, New York, 1986)CrossRefMATHGoogle Scholar
  20. [RS97a]
    G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1: Word, Language, Grammar (Springer, New York, 1997)Google Scholar
  21. [Sal73]
    A. Salomaa, Formal Languages (Academic Press, London, 1973)MATHGoogle Scholar
  22. [Tur36]
    A.M. Turing, On computable numbers, with an application to the entscheidungsproblem. Proc. Lond. Math. Soc. 42(2), 230–265 (1936)MathSciNetMATHGoogle Scholar
  23. [Woo87]
    D. Wood, Theory of Computation: A Primer (Addison-Wesley, Boston, 1987)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Alexander Meduna
    • 1
  • Ondřej Soukup
    • 2
  1. 1.Department of Computer ScienceBrno University of TechnologyBrnoCzech Republic
  2. 2.Department of Information TechnologyBrno University of TechnologyBrnoCzech Republic

Personalised recommendations