On classes of regular languages related to monotone WQOs

DOI10.1007/978-3-030-23247-4_18zbMATH Open1434.68280OpenAlexW2955005634MaRDI QIDQ2179340

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

decidabilityregular languagedifference hierarchyperiodic extensionlattice of upper setsmonotone well-quasiorders

Mathematics Subject Classification ID

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

Related Items (2)

The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages ⋮ A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\)

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)