Language-Generating Automata and State-Controlled Computation

  • Alexander Meduna
  • Ondřej Soukup


Traditionally, computation controlled by finitely many states is formalized by finite state automata, which accept their languages (see Sect.  2.4). Untraditionally, however, the present chapter explains how to adapt these automata in a very natural way so they act as language generators just like grammars. Consequently, the formalization of state-controlled computation can be based on the language-generating automata resulting from this adaptation.


  1. [BF94]
    H. Bordihn, H. Fernau, Accepting grammars with regulation. Int. J. Comput. Math. 53(1), 1–18 (1994)CrossRefMATHGoogle Scholar
  2. [BF95]
    H. Bordihn, H. Fernau, Accepting grammars and systems: an overview, in Proc. of Development in Language Theory Conf., Magdeburg (1995), pp. 199–208Google Scholar
  3. [DP89]
    J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989)CrossRefMATHGoogle Scholar
  4. [Kas70]
    T. Kasai, A hierarchy between context-free and context-sensitive languages. J. Comput. Syst. Sci. 4, 492–508 (1970)MathSciNetCrossRefMATHGoogle Scholar
  5. [MHHO05]
    E. Moriya, D. Hofbauer, M. Huber, F. Otto, On state-alternating context-free grammars. Theor. Comput. Sci. 337, 183–216 (2005)MathSciNetCrossRefMATHGoogle 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