On quasi orders of words and the confluence property

DOI10.1016/S0304-3975(97)00259-4zbMath0915.68104MaRDI QIDQ1276254

Lucian Ilie, Tero J.Harju

Publication date: 20 January 1999

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

zbMATH Keywords

decidabilityconfluenceinfinite wordquasi orderdown-set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Well quasi-orders generated by a word-shuffle rewriting ⋮ Well Quasi-orders in Formal Language Theory ⋮ Well quasi-orders and context-free grammars ⋮ Theories of orders on the set of words ⋮ On well quasi orders of free monoids ⋮ Well quasi-orders, unavoidable sets, and derivation systems ⋮ On the expressivity of time-varying graphs

Cites Work

• On regularity of context-free languages
• Every iterated morphism yields a co-CFL
• Prefixes of infinite words and ambiguous context-free languages
• Iterated GSMs and CO-CFL
• Adherences of languages
• Effective constructions in well-partially-ordered free monoids
• The theory of well-quasi-ordering: a frequently discovered concept
• Languages obtained from infinite words
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On quasi orders of words and the confluence property