Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1996: Automata, Languages and Programming pp 393–402Cite as

On ω-generators and codes

  • Session 9: Combinatories on Words
  • Conference paper
  • First Online:

  • 131 Accesses

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

Abstract

Let C be a class of codes. Given a rational language L, deciding whether L ω has an ω-generator in C is still an open problem except if C denotes the set of prefix codes [9]. Here, we restrict our investigations to ω-languages L ω whose greatest ω-generator is a free submonoid. For such ω-languages, we prove that there exists an ω-generator in the sets of pure codes, circular codes, suffix codes or finite ω-codes if and only if the root of the greatest ω-generator is itself one. Furthemore, in the very precise case where the root of the greatest ω-generator is a three-element code, using a characteristic property of them [5, 6], we characterize the case where W ω = L ω some ω-code W-finite or infinite-.

This work was supported by the GDR-PRC Mathématiques et Informatique.

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. J. Berstel and D. Perrin. Theory of codes. Academic Press, New-York, 1985.

    Google Scholar 

  2. J. Devolder. Comportement des codes vis-à-vis des mots infinis et bi-infinis — Comparaison. In D. Krob, editor, Théories des automates et applications, pages 75–89. Deuxièmes Journées franco-belges, Publications de l'Universitŕ de Rouen, 1992.

    Google Scholar 

  3. J. Devolder, M. Latteux, I. Litovsky, and L. Staiger. Codes and infinite words. Acta Cybernetica, 11(4):241–256, 1994.

    Google Scholar 

  4. J. Devolder-Muchembled. Codes, mots infinis et bi-infinis. PhD thesis, Université de Lille, 1993.

    Google Scholar 

  5. J. Karhumäki. On three-element codes. Theoretical Computer Science, 40:3–11, 1985.

    Article  Google Scholar 

  6. J. Karhumäki. A property of three-element codes. Theoretical Computer Science, 41:215–222, 1985.

    Article  Google Scholar 

  7. I. Litovsky. Générateurs des langages rationnels de mots infinis. PhD thesis, Université de Lille, 1988.

    Google Scholar 

  8. I. Litovsky. Free submonoids and minimal ω-generators of L ω. Acta Cybernetica, 10(1–2):35–43, 1991.

    Google Scholar 

  9. I. Litovsky. Prefix-free languages ω-generators. Information Processing Letters, 37:61–65, 1991.

    Article  Google Scholar 

  10. I. Litovsky and E. Timmerman. On generators of rational ω-power languages. Theoretical Computer Science, 53:187–200, 1987.

    Article  Google Scholar 

  11. L. Staiger. On infinitary length codes. Theoretical Informatics and Applications, 20(4):483–494, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire I3S-U.R.A. 1376-C.N.R.S., Université de Nice Sophia Antipolis, 650, route des Colles, B.P. 145, 06903, Sophia Antipolis Cedex, France

    Sandrine Julia

Authors
  1. Sandrine Julia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedhelm Meyer Burkhard Monien

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Julia, S. (1996). On ω-generators and codes. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_145

Download citation

  • DOI: https://doi.org/10.1007/3-540-61440-0_145

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61440-1

  • Online ISBN: 978-3-540-68580-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation