Skip to main content
SpringerLink
Log in

Completing biprefix codes

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

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

Included in the following conference series:

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, D. Perrin, M. P. Schützenberger, The Theory of Codes, to appear.

    Google Scholar 

  2. Y. Césari, Propriétés combinatoires des codes biprefixes, in Théorie des codes (D.Perrin ed.) LITP, 1979, 20–46.

    Google Scholar 

  3. S. Eilenberg, Automata, Languages and Machines, Vol, A, Academic Press, 1974.

    Google Scholar 

  4. D. Perrin, Codes asynchrones, Bull. Soc. Math. de France, 105, 1977, 325–404.

    MathSciNet  MATH  Google Scholar 

  5. A. Restivo, On codes having no finite completions, in Automata Languages and Programming (S. Michaelson ed.) Edinburgh University Press 1976, 38–44.

    Google Scholar 

  6. A. Salomaa, M. Soittola, Automata Theoretic Aspects of Formal Power Series, Springer-Verlag, 1978.

    Google Scholar 

  7. M. P. Schützenberger, A remark on incompletely specified automata, Information and Control. 8, 1965, 373–376.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique LITP, Université de Rouen, BP 67, 76130, Mont-Saint-Aignan, France

    D. Perrin

Authors
  1. D. Perrin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perrin, D. (1982). Completing biprefix codes. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012786

Download citation

  • DOI: https://doi.org/10.1007/BFb0012786

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation