Skip to main content
SpringerLink
Log in

Prefix and perfect languages

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

Included in the following conference series:

Abstract

This paper is devoted to the study of languages satisfying the prefixity property and of those that are the star of the previous ones.

It is proved that the respective families PREF and PERF are closed under intersection duos and that the duos of regular sets, of linear and of one-counter languages are non-principal.

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. Autebert J.M. — Non-principalité du cylindre des langages à compteur, Math. Systems Theory, 11, 157–167, 1977.

    Article  Google Scholar 

  2. Autebert J.M., Beauquier J., Boasson L., Senizergues G. — Remarques sur les langages de parenthèses, submitted to Acta Informatica, (available in LITP report).

    Google Scholar 

  3. Berstel J. — Transductions and context-free languages, Teubner Verlag — 1980.

    Google Scholar 

  4. Boasson L. & Nivat M. — Le cylindre des langages linéaires, Math. Syst. Theory 11, 147–155, 1977.

    Article  Google Scholar 

  5. Cesari Y. — Sur un algorithme donnant les codes bipréfixes finis, Math. Syst. Theory 6 (3), 221–225, 1972.

    Article  Google Scholar 

  6. Eilenberg S. — Automata, Languages and Machines, Vol. A, Academic Press, New York and London, 1974.

    Google Scholar 

  7. Ginsburg S. — Algebraic and automata — theoretic properties of context-free languages. — North Holland, 1975.

    Google Scholar 

  8. Greibach S. — The hardest context-free language, SIAM Journal of Comp. 2, 301–304, 1973.

    Google Scholar 

  9. Harrison M. — Introduction to formal languages theory, Addison-Wesley Reading, Mass, 1978.

    Google Scholar 

  10. Nivat M. & Perrot J.F. — Une généralisation du monoïde bicyclique, C.R. Acad. Sci. Paris, 217 A, 824–827, 1970.

    Google Scholar 

  11. Perrin D. — La transitivité du groupe d'un code bipréfixe fini, Math. Z. 153, 283–287, 1977.

    Article  Google Scholar 

  12. Perrot J.F. — Groupes de permutations associés aux codes préfixes finis, in A. Lentîn (Ed.), Permutations, Gauthiers-Villars, Mouton, Paris, 19–35, 1974.

    Google Scholar 

  13. Schützenberger M.P. — On the synchronization properties of certain prefix codes, Inf. Control 7, 23–36, 1964.

    Article  Google Scholar 

  14. Takahashi M. — Nest sets and relativized closure properties, to appear in Theoretical Comp. Sci.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P. and Université de Picardie — U.E.R. de Mathématiques, 33, rue St Leu, F. 80039, Amiens Cedex

    J. Beauquier

Authors
  1. J. Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beauquier, J. (1983). Prefix and perfect languages. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

  • Online ISBN: 978-3-540-38714-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation