↓ Skip to main content

Combinatorics on Words

Overview of attention for book
Cover of 'Combinatorics on Words'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Which Arnoux-Rauzy Words Are 2-Balanced?
  3. Altmetric Badge
    Chapter 2 Dynamical Equivalence of Morphisms
  4. Altmetric Badge
    Chapter 3 Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem
  5. Altmetric Badge
    Chapter 4 Subword Complexity in Free Groups
  6. Altmetric Badge
    Chapter 5 Non-constructive Methods for Avoiding Repetitions in Words
  7. Altmetric Badge
    Chapter 6 Words, Trees and Automata Minimization
  8. Altmetric Badge
    Chapter 7 Auto-similarity in Rational Base Number Systems
  9. Altmetric Badge
    Chapter 8 Infinite Words with Well Distributed Occurrences
  10. Altmetric Badge
    Chapter 9 Generating Discrete Planes with Substitutions
  11. Altmetric Badge
    Chapter 10 Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm
  12. Altmetric Badge
    Chapter 11 The Lexicographic Cross-Section of the Plactic Monoid Is Regular
  13. Altmetric Badge
    Chapter 12 Suffix Conjugates for a Class of Morphic Subshifts
  14. Altmetric Badge
    Chapter 13 Periodicity Forcing Words
  15. Altmetric Badge
    Chapter 14 Balancedness of Arnoux-Rauzy and Brun Words
  16. Altmetric Badge
    Chapter 15 Open and Closed Prefixes of Sturmian Words
  17. Altmetric Badge
    Chapter 16 Finitely Generated Ideal Languages and Synchronizing Automata
  18. Altmetric Badge
    Chapter 17 A Note on Square-Free Shuffles of Words
  19. Altmetric Badge
    Chapter 18 Strongly k -Abelian Repetitions
  20. Altmetric Badge
    Chapter 19 Similarity Relations and Repetition-Freeness
  21. Altmetric Badge
    Chapter 20 On Quasiperiodic Morphisms
  22. Altmetric Badge
    Chapter 21 Enumerating Abelian Returns to Prefixes of Sturmian Words
  23. Altmetric Badge
    Chapter 22 Regular Ideal Languages and Synchronizing Automata
  24. Altmetric Badge
    Chapter 23 Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
  25. Altmetric Badge
    Chapter 24 Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants
  26. Altmetric Badge
    Chapter 25 On Infinite Words Determined by L Systems
  27. Altmetric Badge
    Chapter 26 Sets Represented as the Length- n Factors of a Word
Attention for Chapter 22: Regular Ideal Languages and Synchronizing Automata
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
3 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Regular Ideal Languages and Synchronizing Automata
Chapter number 22
Book title
Combinatorics on Words
Published by
Springer, Berlin, Heidelberg, January 2013
DOI 10.1007/978-3-642-40579-2_22
Book ISBNs
978-3-64-240578-5, 978-3-64-240579-2
Authors

Rogério Reis, Emanuele Rodaro, Reis, Rogério, Rodaro, Emanuele

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Portugal 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 67%
Professor > Associate Professor 1 33%
Readers by discipline Count As %
Mathematics 2 67%
Computer Science 1 33%