%0 Conference Proceedings
%T On Classes of Regular Languages Related to Monotone WQOs
%+ Japan Advanced Institute of Science and Technology (JAIST)
%+ A.P. Ershov Institute of Informatics Systems [Novosibirsk]
%+ Kazan Federal University (KFU)
%A Ogawa, Mizuhito
%A Selivanov, Victor
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Košice, Slovakia
%Y Michal Hospodár
%Y Galina Jirásková
%Y Stavros Konstantinidis
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-11612
%P 235-247
%8 2019-07-17
%D 2019
%R 10.1007/978-3-030-23247-4_18
%K Regular language
%K Monotone WQO
%K Lattice of upper sets
%K Periodic extension
%K Decidability
%K Difference hierarchy
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.02
%2 https://inria.hal.science/hal-02387304/document
%2 https://inria.hal.science/hal-02387304/file/480958_1_En_18_Chapter.pdf
%L hal-02387304
%U https://inria.hal.science/hal-02387304
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-11612