Skip to main content
Log in

Image theorems for simple matrix languages andn-parallel languages

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. O. Ibarra, Simple matrix languages,Information and Control 17 (1970), 359–394.

    Google Scholar 

  2. R. D. Rosebrugh andD. Wood, A characterization theorem forn-parallel right linear languages,J. Computer System Sciences 7 (1973), 579–582.

    Google Scholar 

  3. R. Siromoney, Finite turn checking automata,J. Computer System Sciences 5 (1971), 549–559.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Work carried out under a National Research Council of Canada Grant No. A-7700.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762185

Keywords

Navigation