Language-Generating Automata and State-Controlled Computation
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.
- [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