Abstract
We study relationships of monotone well quasiorders to regular languages and ω-languages, concentrating on decidability of the lattices of upper sets on words and infinite words. We establish rather general sufficient conditions for decidability. Applying these conditions to concrete natural monotone WQOs, we obtain new decidability results and new proofs of some known results.
Author supplied keywords
Cite
CITATION STYLE
Ogawa, M., & Selivanov, V. (2019). On Classes of Regular Languages Related to Monotone WQOs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11612 LNCS, pp. 235–247). Springer Verlag. https://doi.org/10.1007/978-3-030-23247-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
