Skip to main content
SpringerLink
Log in
Book cover

IMA International Conference on Cryptography and Coding

Cryptography and Coding 1995: Cryptography and Coding pp 199–204Cite as

Church-Rosser codes

  • Conference paper
  • First Online:

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

Abstract

The notion of code, called Church-Rosser code, is proposed and studied. The necessary and sufficient conditions for a finite set of being a Church-Rosser code are presented. It is proved that property of being a Church-Rosser code defined by a monadic confluent stringrewriting system is decidable. We also propose decidable sufficient conditions for a finite set of being a Church-Rosser code defined by a finite Church-Rosser string-rewriting system.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Anisimov, Finite-automata semigroup mappings, Cybernetics, 5 (1981) 1–7.

    Google Scholar 

  2. J. Berstel, Congruences plus que parfaites et langages algébrique, Séminaire d'Informatique Théorique, Institut de Programmation (1976–77) 123–147.

    Google Scholar 

  3. J. Berstel and L. Boasson, Context-free languages, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, Elsevier Science Publishers B.V., 1990, 59–102.

    Google Scholar 

  4. J. Berstel and D. Perrin, Theory of Codes, Academic Press, 1985.

    Google Scholar 

  5. R. V. Book, Confluent and other types of Thue systems, Journal of ACM, 29 (1982) 171–183.

    Article  Google Scholar 

  6. R. V. Book, Thue systems as rewriting systems, J. Symb. Comp. 3 (1987) 39–68.

    Google Scholar 

  7. R. V. Book and F. Otto, String-Rewriting Systems, Springer: New-York, 1993.

    Google Scholar 

  8. D. Kapur, M. Krishnamoorthy, R. McNaughton and R. Narendran, An O(¦T¦ 3) algorithm for testing the Church-Rosser property of Thue systems, Theor. Comp. Sci. 35 (1985) 109–114.

    Article  Google Scholar 

  9. P. Narendran, C. O'Dunlaing and H. Rolletschek, Complexity of certain decision problems about congruential languages, J. Comp. Syst. Sci. 30, 343–358.

    Google Scholar 

  10. V. A. Oleshchuk, On public-key cryptosystem based on Church-Rosser stringrewriting systems, Computing and Combinatorics: First Annual International Conference (COCOON'95). Proceedings. LNCS 959 (1995) 264–269.

    Google Scholar 

  11. A. Sardinas and G. Patterson, A necessary and sufficient condition for the unique decomposition of coded messages, I.R.E. Int. Conv. Rec. 8 (1953) 104–108.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Agder College, N-4890, Grimstad, Norway

    Vladimir A. Oleshchuk

Authors
  1. Vladimir A. Oleshchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Colin Boyd

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oleshchuk, V.A. (1995). Church-Rosser codes. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-60693-9_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60693-2

  • Online ISBN: 978-3-540-49280-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation