Characterization of ordered semigroups generating well quasi-orders of words

DOI10.1007/S00224-024-10172-0MaRDI QIDQ6580076

Ondřej Klíma, Jonatan Kolegar

Publication date: 29 July 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

finite semigroupsordered semigroupsderivation relationswell-quasi-ordersunavoidable words

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Ordered semigroups and monoids (06F05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On regularity of context-free languages
• How to prove that a language is regular or star-free?
• On total regulators generated by derivation relations
• Finite automata
• Language equations
• Well quasi-orders arising from finite ordered semigroups
• The theory of well-quasi-ordering: a frequently discovered concept
• Regular solutions of language inequalities and well quasi-orders
• Duality and Equational Theory of Regular Languages
• Well Quasi-orders in Formal Language Theory
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Characterization of ordered semigroups generating well quasi-orders of words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580076)