Skip to main content

Codes and automata

  • Applications Of The Theory Of Automata
  • Conference paper
  • First Online:
Formal Properties of Finite Automata and Applications (LITP 1988)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.P. Beal, "Codage, automates locaux et entropie", Thése Univ. Paris VII, 1987.

    Google Scholar 

  2. M.P. Beal, D. Perrin, "Une caracterisation des ensembles sofiques", C.R. Acad.Sc. Paris, 1986.

    Google Scholar 

  3. D. Beauquier, "Minimal automaton for a factorial, transitive and rational language", Report LITP, 1987.

    Google Scholar 

  4. J. Berstel, D. Perrin, "Theory of codes", Academic Press 1985.

    Google Scholar 

  5. F. Blanchard, G. Hansel, "Systemes codes", Theor.Comp.Science, 44, 1986.

    Google Scholar 

  6. A. de Luca, A. Restivo, "On some properties of very pure codes", Theor.Comp.Science, 10, 1980.

    Google Scholar 

  7. A. de Luca, A. Restivo, "A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup", Inform. and Control, 44, 1980.

    Google Scholar 

  8. S. Eilenberg, "Automata, languages and machines", Vol.B, Academic Press, 1976.

    Google Scholar 

  9. R. Fischer, "Sofic systems and graphs", Monast.Math. 80, 1975.

    Google Scholar 

  10. K. Hashiguchi, "Regular languages of star height one", Inform. and Control. 53, 1982.

    Google Scholar 

  11. S.C. Kleene, "Representation of events in nerve nets and finite automata", Automata Studies (Shannon and McCarthy eds.), Princeton University Press, 1956.

    Google Scholar 

  12. J.E. Pin, "On varieties of rational languages and variable length codes", Journal of Pure and Applied Algebra, 23, 1982.

    Google Scholar 

  13. J.E. Pin, "Varieties of formal languages", North Oxford, London and Plenum, New York, 1986.

    Google Scholar 

  14. A. Restivo, "Codes and aperiodic languages", Lecture Notes in Computer Science, 2, Springer Verlag, 1973.

    Google Scholar 

  15. A. Restivo, "On a question of McNaughton and Papert", Inform. and Control, 25, 1974.

    Google Scholar 

  16. A. Restivo, "A combinatorial property of codes having finite synchronization delay", Theor.Comp.Science, 1, 1975.

    Google Scholar 

  17. A. Restivo, "Codes and local constraints", Theor.Comp.Science, to appear.

    Google Scholar 

  18. A. Restivo, "Finitely generated sofic systems", Theor.Comp.Science, to appear.

    Google Scholar 

  19. M.P. Schutzenberger, "On an application of semigroup methods to some problems in coding", I.R.E. Trans. Information Theory, I.T.2, 1956.

    Google Scholar 

  20. M.P. Schutzenberger, "On finite monoids having only trivial subgroups", Inform. and Control, 8, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. E. Pin

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Restivo, A. (1989). Codes and automata. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013121

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics