Skip to main content
SpringerLink
Log in

Varietes de semigroupes et mots infinis

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

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

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. Eilenberg, S., Automata, Languages and Machines, Vol. A, Academic Press, 1974

    Google Scholar 

  2. Eilenberg, S., id., Vol. B, 1976.

    Google Scholar 

  3. Ladner, R., Applications of model-theoric games to discrete linear orders and finite automata, Inform. Contr. (1977), 33, 281–303.

    Google Scholar 

  4. Nivat, M., Perrin, D., Ensembles reconnaissables de mots bi infinis, 18th ACM Conf. on Theory of Computing, San Francisco, 1982, 47–59.

    Google Scholar 

  5. Schützenberger, M.P. A propos des relations rationnelles fonctionnelles, in Automata, Langages and Programming (M.NIVAT ed.) 103–114, North Holland, 1973.

    Google Scholar 

  6. Straubing, H., Aperiodic homomorphisms and the concatenation product of recognizable sets, J. Pure and Applied Algebra, 15, 1979, 319–327.

    Google Scholar 

  7. Thomas, W., Star-free regular sets of Ω-sequences, Inform. Contr. 42 (1979) 148–156.

    Google Scholar 

  8. Thomas, W., A combinatorial approach to the theory of Ω-automata, Inform. Contr. 48 (1981) 261–283.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Dominique Perrin

Authors
  1. Dominique Perrin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perrin, D. (1983). Varietes de semigroupes et mots infinis. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036941

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation