Regulated Automata and Computation
Just like there exist regulated grammars, which formalize regulated computation (see Chap. 3), there also exist their automata-based counterparts for this purpose. Basically, in a very natural and simple way, these automata regulate the selection of rules according to which their sequences of moves are made. These regulated automata represent the principle subject of the present chapter, which covers their most essential types.
- [ABB97]J. Autebert, J. Berstel, L. Boasson, (eds.), Context-Free Languages and Pushdown Automata, in Handbook of Formal Languages, chapter 3 (Springer, Berlin, 1997), pp. 111–174Google Scholar
- [Sir69]R. Siromoney, Studies in the mathematical theory of grammars and its applications, PhD thesis, University of Madras, Madras, India, 1969Google Scholar
- [Woo75]D. Wood, m-parallel n-right linear simple matrix languages. Utilitas Mathematica 8, 3–28 (1975)Google Scholar
- [Woo87]D. Wood, Theory of Computation: A Primer (Addison-Wesley, Boston, 1987)Google Scholar