Skip to main content
SpringerLink
Log in

Equal matrix languages and Kleene closure

  • Published:
Proceedings of the Indian Academy of Sciences - Section A Aims and scope Submit manuscript

Abstract

It is shown that the family of equal matrix languages (EML) which intersects the family of context-sensitive and context-free languages is not closed under Kleene closure, intersection and complementation. The family of bounded EML whose generative power lies between that of bounded context-sensitive languages and bounded context-free languages is shown to be a class of unambiguous languages. Operations that preserve unambiguity and certain decidability questions are discussed.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Eilenberg, S. and Schutzenberger, M. P. “Rational sets in commutative monoids,”Journal of Algebra, 1969,13, 173–91.

    Article  MATH  MathSciNet  Google Scholar 

  • Ginsburg, S...The Mathematical Theory of Context-Free Languages, McGraw-Hill Book Company, New York, 1966.

    MATH  Google Scholar 

  • — and Greibach, S. A... “Abstract families of languages, Studies in abstract families of languages,”Mem. Amer. Math. Soc., 1969,87, 1–32.

    MathSciNet  Google Scholar 

  • — and Spanier, E. H... “Finite-turn pushdown automata,”SIAM J. of Control., 1966,4, 429–53.

    Article  MATH  MathSciNet  Google Scholar 

  • Ginsburg, S. and Ullian, J. S... “Ambiguity in context-free languages,”J. Assoc. Comput. Mach., 1966a,13, 62–89.

    MATH  MathSciNet  Google Scholar 

  • —.. “Preservation of unambiguity and inherent ambiguity in context-free languages.“Ibid., 1966 b,13, 364–68.

    MATH  MathSciNet  Google Scholar 

  • Greibach, S. A... “The unsolvability of the recognition of linear context-free languages,“Ibid., 1966,16, 91–106.

    MathSciNet  Google Scholar 

  • —.. “A note on undecidable properties of formal languages,”Math. Systems Theory, 1967,2, 1–6.

    Article  MathSciNet  Google Scholar 

  • Ibarra, O. H... “Simple matrix languages,”Inform. Control, 1970,17, 359–94.

    Article  MATH  MathSciNet  Google Scholar 

  • Landweber, P. S... “Decision problems of phrase-structure grammars,”IEEE Trans., 1964,EC-13, 354–62.

    Google Scholar 

  • Parikh, R. J... “On context-free languages,”J. Assoc. Comput. Mach., 1966,13, 570–81.

    MATH  MathSciNet  Google Scholar 

  • Post, E. L... “A variant of a recursively unsolvable problem,”Bull. Amer. Math. Soc., 1946,52, 264–68.

    Article  MATH  MathSciNet  Google Scholar 

  • Siromoney, G. .. “Grammar for kernel sentences in Tamil,”Foundations of Language, 1971 (To appear).

  • Siromoney, R... “On equal matrix languages,”Inform. Control, 1969a,14, 135–51.

    Article  MATH  MathSciNet  Google Scholar 

  • —.. “A characterization of semilinear sets,”Proc. Amer. Math. Soc., 1969b,21, 689–94.

    Article  MATH  MathSciNet  Google Scholar 

  • —.. “Channel capacity of equal matrix languages,”Inform. Control, 1969c,14, 507–11.

    Article  MATH  MathSciNet  Google Scholar 

  • - ..Studies in the Mathematical Theory of Grammars and Applications, Ph.D. Dissertation, University of Madras, 1969d.

  • - .. “Unambiguous equal matrix languages,”Inform. Control, 1971 (To appear).

Download references

Author information

Authors and Affiliations

  1. Madras Christian College, Tambaram

    Rani Siromoney & Gift Siromoney

Authors
  1. Rani Siromoney
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gift Siromoney
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Prof. R. Narasimhan,f.a.sc.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Siromoney, R., Siromoney, G. Equal matrix languages and Kleene closure. Proc. Indian Acad. Sci. 74, 172–188 (1971). https://doi.org/10.1007/BF03050596

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation