Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
H. Bordihn, H. Fernau, Accepting grammars with regulation. Int. J. Comput. Math. 53(1), 1–18 (1994)
H. Bordihn, H. Fernau, Accepting grammars and systems: an overview, in Proc. of Development in Language Theory Conf., Magdeburg (1995), pp. 199–208
J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989)
T. Kasai, A hierarchy between context-free and context-sensitive languages. J. Comput. Syst. Sci. 4, 492–508 (1970)
E. Moriya, D. Hofbauer, M. Huber, F. Otto, On state-alternating context-free grammars. Theor. Comput. Sci. 337, 183–216 (2005)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Meduna, A., Soukup, O. (2017). Language-Generating Automata and State-Controlled Computation. In: Modern Language Models and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-63100-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-63100-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63099-1
Online ISBN: 978-3-319-63100-4
eBook Packages: Computer ScienceComputer Science (R0)