DOI

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.
Язык оригиналаанглийский
Название основной публикацииDescriptional Complexity of Formal Systems
Страницы235-247
Число страниц13
DOI
СостояниеОпубликовано - 1 янв 2019
Событие21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 - Košice, Словакия
Продолжительность: 17 июл 2019 → 19 июл 2019

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ИздательSpringer Nature
Том11612
ISSN (печатное издание)0302-9743

конференция

конференция21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019
Страна/TерриторияСловакия
ГородKošice
Период17/07/19 → 19/07/19

ID: 126994992