Abstract
Three image theorems are proved for three families of languages in terms of prototype languages and (nondeterministic) generalized sequential machine maps. Further, for one family, then-right linear simple matrix languages of Ibarra, a new characterization theorem is proved.
Similar content being viewed by others
References
O. Ibarra, Simple matrix languages,Information and Control 17 (1970), 359–394.
R. D. Rosebrugh andD. Wood, A characterization theorem forn-parallel right linear languages,J. Computer System Sciences 7 (1973), 579–582.
R. Siromoney, Finite turn checking automata,J. Computer System Sciences 5 (1971), 549–559.
Author information
Authors and Affiliations
Additional information
Work carried out under a National Research Council of Canada Grant No. A-7700.
Rights and permissions
About this article
Cite this article
Rosebrugh, R.D., Wood, D. Image theorems for simple matrix languages andn-parallel languages. Math. Systems Theory 8, 150–155 (1974). https://doi.org/10.1007/BF01762185
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01762185