Skip to main content
SpringerLink
Log in

Groups, codes and unambiguous automata

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

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

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, Transductions and context-free languages, Teubner, Stuttgart (1979).

    Google Scholar 

  2. J. Berstel, D. Perrin et al., The theory of codes, to appear.

    Google Scholar 

  3. S. Eilenberg, Automata, languages and machines, vol. B, Academic Press, New-York (1976).

    Google Scholar 

  4. G. Lallement, Semigroups and combinatorial applications, Wiley, New-York (1979).

    Google Scholar 

  5. E. Le Rest and M. Le Rest, Sur les relations entre un nombre fini de mots, Thèse de troisième cycle, Rouen (1979).

    Google Scholar 

  6. E. Le Rest and S. Margolis, On the group complexity of a finite language, in Lecture Notes in Computer Science 154, Springer (1983), 433–434.

    Google Scholar 

  7. S. Margolis, On the syntactic transformation semigroup of the language generated by a finite biprefix code, Theoretical Computer Science 21 (1982), 225–230.

    Google Scholar 

  8. D. Perrin, La transitivité du groupe d'un code bipréfixe fini, Mathematische Zeitschrift 153 (1977), 283–287.

    Google Scholar 

  9. D. Perrin, Sur les groupes dans les monoides finis, in Actes du Colloque Non commutative methods in algebraic and geometric combinatorics (A. de Luca ed.) Napoli (1979), 27–45.

    Google Scholar 

  10. D. Perrin and J.F. Perrot, A propos des groupes dans certains monoïdes syntactiques, in Lecture Notes in Mathematics 855, Springer (1980), 82–91.

    Google Scholar 

  11. J.E. Pin, Variétés de langages formels, Dunod, Paris (1984).

    Google Scholar 

  12. J.E. Pin and J. Sakarovitch, Operations and transductions that preserve rationality, in 6th G.I. Conference, Lecture Notes in Computer Science 145, Springer, 277–288.

    Google Scholar 

  13. G. Rindone, Groupes finis et monoïdes syntactiques, Thèse de troisième cycle, Paris (1983).

    Google Scholar 

  14. J. Sakarovitch, Sur la définition du produit en couronne, in Colloque Codages et transductions (Pirillo ed.), Florence (1981), 285–300.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P., Tour 55–56 2 place Jussieu, 75221, Paris Cedex 05, France

    Pascal Weil

Authors
  1. Pascal Weil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weil, P. (1984). Groups, codes and unambiguous automata. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024023

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation