Characterization of ordered semigroups generating well quasi-orders of words

DOI10.1007/S00224-024-10172-0MaRDI QIDQ6580076zbMATH OpenFDO

Authors Ondřej Klíma, Jonatan Kolegar

Publication date 29 July 2024

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

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

finite semigroupsordered semigroupsderivation relationswell-quasi-ordersunavoidable words

Mathematics Subject Classification ID

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

Cites work

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

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)