Skip to main content
SpringerLink
Log in

Finite biprefix sets of paths in a Graph

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

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

Included in the following conference series:

  • 119 Accesses

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, D. Perrin, The theory of Codes, Academic Press, 1985

    Google Scholar 

  2. J. Berstel, C. Reutenauer, Rational Series and Their Languages, Springer-Verlag, to appear

    Google Scholar 

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

    Google Scholar 

  4. Y. Césari (1979), Propriétés combinatoires des codes bipréfixes complets finis: in D. Perrin, ed., Actes de la 7ème Ecole de Printemps d' Informatique Théorique (Jougne, 1979) 29–46

    Google Scholar 

  5. G. Lallement, Semigroups and Combinatorial Applications, J. Wiley and Sons, New York, 1979

    Google Scholar 

  6. D. Perrin (1984), Completing biprefix codes, Theor. Comp. Science 28, 329–336

    Google Scholar 

  7. C. Reutenauer (1981), Intégration des codes bipréfixes (d'après Césari), Seminaire d'Informatique Théorique LITP (1981–1982) 67–81

    Google Scholar 

  8. C. Reutenauer, Ensembles libres de chemins dans un graphe, to appear

    Google Scholar 

  9. B. Tilson, Semigroupoids, to appear

    Google Scholar 

  10. M.P. Schützenberger (1961), On a special class of recurrent events, Ann. Math. Stat. 32, 1201–1213.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Matematica dell'Università di Napoli, Napoli, Italie

    Clelia De Felice

  2. LITP, 4 Place Jussieu, 75005, Paris, France

    Clelia De Felice

Authors
  1. Clelia De Felice
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Felice, C. (1986). Finite biprefix sets of paths in a Graph. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39859-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation