Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
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–174
J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989)
P.C. Fischer, A.L. Rosenberg, Multitape one-way nonwriting automata. J. Comput. Syst. Sci. 2, 38–101 (1968)
M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Boston, 1978)
O.H. Ibarra, Simple matrix languages. Inf. Control 17, 359–394 (1970)
R.D. Rosebrugh, D. Wood, A characterization theorem for n-parallel right linear languages. J. Comput. Syst. Sci. 7, 579–582 (1973)
R.D. Rosebrugh, D. Wood, Restricted parallelism and right linear grammars. Utilitas Mathematica 7, 151–186 (1975)
A. Salomaa, Formal Languages (Academic Press, London, 1973)
R. Siromoney, Studies in the mathematical theory of grammars and its applications, PhD thesis, University of Madras, Madras, India, 1969
R. Siromoney, Finite-turn checking automata. J. Comput. Syst. Sci. 5, 549–559 (1971)
D. Wood, Properties of n-parallel finite state languages. Technical report, McMaster University, 1973
D. Wood, m-parallel n-right linear simple matrix languages. Utilitas Mathematica 8, 3–28 (1975)
D. Wood, Theory of Computation: A Primer (Addison-Wesley, Boston, 1987)
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). Regulated Automata and Computation. In: Modern Language Models and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-63100-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-63100-4_7
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)