On Classes of Regular Languages Related to Monotone WQOs
2019
We study relationships of monotone well quasiorders to regular languages and \(\omega \)-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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
19
References
0
Citations
NaN
KQI