Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1989: Automata, Languages and Programming pp 63–79Cite as

Factors of words

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold, A syntactic congruence for rational θ-languages, Theor. Comput. Sc. 39, 1985, 333–335.

    Article  Google Scholar 

  2. D. Beauquier, Bilimites de langages reconnaissables, Theor. Comput. Sc. 33, 1984, 335–342.

    Article  Google Scholar 

  3. D. Beauquier, Ensembles reconnaissables de mots biinfinis, limite et déterminisme in Automata on Infinite Words (M. Nivat and D. Perrin, Eds.), Lecture Notes in Computer Science 192, 1985, 28–46.

    Google Scholar 

  4. D. Beauquier et M. Nivat, About rational sets of factors of a biinfinite word. Proc. 12th ICALP (W.Brauer, Ed.), Lecture Notes in Computer Science 194, 1985, 33–42.

    Google Scholar 

  5. D. Beauquier, Thin homogeneous sets of factors, Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 241, 239–251.

    Google Scholar 

  6. J.A. Brzozowski and I. Simon, Characterizations of locally testable languages, Discrete Math. 4, 1973, 243–271.

    Article  Google Scholar 

  7. J.R. Büchi, On a decision method in restricted second order arithmetic, in Logic Methodology and Philosophy of Science, (Proc. 1960 Internat. Congr.), Standford University Press, stanford, California, 1960, 1–11.

    Google Scholar 

  8. K.J. Compton, On rich words, in Combinatorics on words, Progress and Perspectives (L.J. Cummings ed.) Academic Press 1983, 39–61.

    Google Scholar 

  9. H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic, Springer, 1984.

    Google Scholar 

  10. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, Vol. A, 1974; Vol B, 1976.

    Google Scholar 

  11. R. Ladner, Application of model-theoretic game to discrete linear orders and fininte automata, Information and Control 33, 1977, 281–303.

    Article  Google Scholar 

  12. G. Lallement, Semigroups and Combinatorial Applications, Wiley, New York, 1979.

    Google Scholar 

  13. M. Lothaire, Combinatorics on words, Encyclopedia of Mathematics 17, Addison-Wesley, New York, 1983.

    Google Scholar 

  14. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control 9, 1971, 521–530.

    Google Scholar 

  15. R. McNaughton, Algebraic decision procedures for local testability, Math. Syst. Theor. 8, 1974, 60–76.

    Article  Google Scholar 

  16. M. Nivat and D. Perrin, Ensembles reconnaissables de mots biinfinis, Canad. J. Math. 38, 1986, 513–537.

    Google Scholar 

  17. J.P. Pécuchet, On the complementation of Büchi automata, Theor. Comput. Sci. 47, 1986, 95–98.

    Article  Google Scholar 

  18. J.P. Pécuchet, Variétés de semigroupes et mots infinis, Proc. 3rd Symp. on Theor. Aspects of Comp. Sci. (G. Vidal-Naquet, Ed.), Lecture Notes in Computer Science 210, 1986, 180–191.

    Google Scholar 

  19. J.P. Pécuchet, Etude syntactique des parties reconnaissables de mots infinis, Proc. 13th ICALP (L. Kott, Ed.), Lecture Notes in Computer Science 226, 1986, 294–303.

    Google Scholar 

  20. D. Perrin, Recent results on automata and infinite words, Math. Found. of Comp. Sci. (M.P. Chytil, V. Koubek, Eds.), Lecture Notes in Computer Science 176, 1984, 134–148.

    Google Scholar 

  21. D. Perrin, Variétés de semigroupes et mots infinis, C. R. Acad. Sci. Paris 295, 1985, 595–598.

    Google Scholar 

  22. D. Perrin, An introduction to finite automata on infinite words, in Automata on Infinite Words (M. Nivat and D. Perrin, Eds.), Lecture Notes in Computer Science 192, 1985, 2–17.

    Google Scholar 

  23. D. Perrin and J.E. Pin, First order logic and star-free sets, J. Comput. System Sci., 32, 1986, 393–406.

    Article  Google Scholar 

  24. D. Perrin and P.E. Schupp, Automata on the integers, recurrence distinguishability, and the equivalence and decidability of monadic theories, Proc. 1st Symp. on Logic in Computer Sci., 1986, 301–304.

    Google Scholar 

  25. J.E. Pin, Varieties of formal languages, North Oxford Academic, London and Plenum, New-York, 1986.

    Google Scholar 

  26. D. Thérien, A. Weiss, Graph congruences and wreath products, J. Pure Applied Algebra 35 (1985) 205–215.

    Article  Google Scholar 

  27. W. Thomas, The theory of successor with an extra predicate, Math. Ann. 237 1978, 121–132.

    Article  Google Scholar 

  28. W. Thomas, Star-free regular sets of θ-sequences, Information and Control 42, 1979, 148–156.

    Article  Google Scholar 

  29. W. Thomas, A combinatorial approach to the theory of θ-automata, Information and Control 48, 1981, 261–283.

    Article  Google Scholar 

  30. W. Thomas, Classifying regular events in symbolic logic, Journal of Computer and System Sciences 25, 1982, 360–376.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP, Université Paris VI et CNRS, France

    Danièle Beauquier & Jean-Eric Pin

Authors
  1. Danièle Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Eric Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beauquier, D., Pin, JE. (1989). Factors of words. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035752

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation