dc.contributor.author |
Ogawa M. |
|
dc.contributor.author |
Selivanov V. |
|
dc.date.accessioned |
2020-01-15T21:18:07Z |
|
dc.date.available |
2020-01-15T21:18:07Z |
|
dc.date.issued |
2019 |
|
dc.identifier.issn |
0302-9743 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/155608 |
|
dc.description.abstract |
© 2019, IFIP International Federation for Information Processing. 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. |
|
dc.relation.ispartofseries |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|
dc.subject |
Decidability |
|
dc.subject |
Difference hierarchy |
|
dc.subject |
Lattice of upper sets |
|
dc.subject |
Monotone WQO |
|
dc.subject |
Periodic extension |
|
dc.subject |
Regular language |
|
dc.title |
On Classes of Regular Languages Related to Monotone WQOs |
|
dc.type |
Conference Paper |
|
dc.relation.ispartofseries-volume |
11612 LNCS |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
235 |
|
dc.source.id |
SCOPUS03029743-2019-11612-SID85069440471 |
|