Skip to main content
SpringerLink
Log in

On ambiguity of DTOL systems

  • Session 1 Automata And Formal Languages
  • Conference paper
  • First Online:
Book cover Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 287))

  • 113 Accesses

Abstract

A DTOL system is unambiguous if no two different sequences of morphisms yield the same word from an axiom. A subfamily of DTOL systems with decidable ambiguity problem is exhibited. Four different sufficient conditions for a DTOL system to be unambiguous are formulated. These DTOL systems are very much suitable for the construction of public key cryptosystems based on L systems. We also prove that for DOL systems over a binary alphabet, the ambiguity problem is effectively decidable. This result has useful applications in the construction of public key cryptosystems which encrypt plain-texts over a binary alphabet using a TOL system obtained from an underlying unambiguous DOL system.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel and D. Perrin (1985), ‘Theory of Codes', Academic Press, New York.

    Google Scholar 

  2. J. Dassow (1984), A note on DTOL systems, Bull. EATCS, 22, 11–14.

    Google Scholar 

  3. Do Long Van (1982), Codes avec des mots infinis, RAIRO informatique Theorique 16, 371–386.

    Google Scholar 

  4. Do Long Van (1985), Ensembles code-compatibles et une generalisation du theoreme de Sardinas-Patterson, Theo. Comp. Sci. 38,123–132.

    Article  Google Scholar 

  5. S. Ginsburg (1986), ‘The Mathematical Theory of Context-free languages', McGraw Hill, New York.

    Google Scholar 

  6. A.Reedy and W.J.Savitch (1974), Ambiguity in developmental systems, Proc. of the 1974 Conf. on Biologically Motivated Automata Theory, 97–105.

    Google Scholar 

  7. G. Rozenberg and A. Salomaa (1980), ‘The Mathematical Theory of L systems', Academic Press, New York.

    Google Scholar 

  8. A. Salomaa (1973), ‘Formal Languages', Academic Press, New York.

    Google Scholar 

  9. A. Salomaa (1985), ‘Computation and Automata', Encyclopaedia of Mathematics and its Applications, 25, Cambridge University Press, New York.

    Google Scholar 

  10. K.G.Subramanian, R.Siromoney and Abisha Jeyanthi (1987), A DOL-TOL public-key cryptosystem, To appear in Inform. Proc. Lett.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Madras Christian College, Tambaram, 600 059, Madras

    K. G. Subramanian, Do Van Long & Rani Siromoney

Authors
  1. K. G. Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Do Van Long
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rani Siromoney
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Subramanian, K.G., Van Long, D., Siromoney, R. (1987). On ambiguity of DTOL systems. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-18625-5_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18625-0

  • Online ISBN: 978-3-540-48033-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation