On classes of regular languages related to monotone WQOs

DOI10.1007/978-3-030-23247-4_18MaRDI QIDQ2179340zbMATH OpenOpenAlexFDO

Authors Mizuhito Ogawa, Victor Selivanov

Publication date 12 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-23247-4_18

zbMATH Keywords

decidabilitydifference hierarchylattice of upper setsmonotone well-quasiordersperiodic extensionregular language

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Partial orders, general (06A06) Formal languages and automata (68Q45)

Recommendations

• Well-quasi-orders and regular \(\omega\)-languages
• Well quasi-orders and regular languages
• A class of rational relations generalising the subword order
• On well quasi orders of free monoids
• Regular tree languages and quasi orders

Cited in

(8)

• On well quasi orders of free monoids
• Well quasi-orders and regular languages
• The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
• A syntactic approach to the MacNeille completion of ^, the free monoid over an ordered alphabet
• WQO is decidable for factorial languages
• A Robust Class of Regular Languages
• A class of rational relations generalising the subword order
• scientific article; zbMATH DE number 5205535 (Why is no real title available?)

This page was built for publication: On classes of regular languages related to monotone WQOs

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