Well quasi-orders and regular languages

DOI10.1007/BF01213206zbMath0818.68115MaRDI QIDQ1338899

Aldo De Luca, Stefano Varricchio

Publication date: 18 December 1994

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

automata theoryMyhill's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (7)

WQO is decidable for factorial languages ⋮ Well quasi-orders generated by a word-shuffle rewriting ⋮ Well Quasi-orders in Formal Language Theory ⋮ Well quasi-orders and context-free grammars ⋮ Stefano Varricchio (1960-2008) ⋮ Unnamed Item ⋮ Well quasi-orders, unavoidable sets, and derivation systems

Cites Work

• On regularity of context-free languages
• Commutative one-counter languages are regular
• Finiteness and iteration conditions for semigroups
• The theory of well-quasi-ordering: a frequently discovered concept
• Some applications of a theorem of Shirshov to language theory
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Well quasi-orders and regular languages