On well quasi orders of free monoids

DOI10.1016/S0304-3975(98)00036-XzbMath0913.68114MaRDI QIDQ1275465

Lucian Ilie, Arto Salomaa

Publication date: 12 January 1999

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

zbMATH Keywords

confluencewell quasi orderdown-seteffective regularity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Well quasi-orders generated by a word-shuffle rewriting ⋮ Well Quasi-orders in Formal Language Theory ⋮ Well quasi-orders and context-free grammars ⋮ Well quasi-orders, unavoidable sets, and derivation systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective constructions in well-partially-ordered free monoids
• On quasi orders of words and the confluence property
• A note on decidability questions on presentations of word semigroups
• The theory of well-quasi-ordering: a frequently discovered concept
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• On a question of Eggan
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: On well quasi orders of free monoids