Une généralisation des théorèmes de Higman et de Simon aux mots infinis

DOI10.1016/0304-3975(85)90216-6zbMath0572.68065OpenAlexW2015148487MaRDI QIDQ1062465

Alain Finkel

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90216-6

zbMATH Keywords

infinite wordssubwordquasi-order

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

The ω-Regular Post Embedding Problem ⋮ Algebraic properties of the shuffle over \(\omega\)-trajectories

Cites Work

• The theory of well-quasi-ordering: a frequently discovered concept
• Ordering by Divisibility in Abstract Algebras
• Partial well‐ordering of sets of vectors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Une généralisation des théorèmes de Higman et de Simon aux mots infinis