Standard

On Classes of Regular Languages Related to Monotone WQOs. / Ogawa, Mizuhito; Selivanov, Victor.

Descriptional Complexity of Formal Systems. 2019. стр. 235-247 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11612).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Ogawa, M & Selivanov, V 2019, On Classes of Regular Languages Related to Monotone WQOs. в Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 11612, стр. 235-247, 21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019, Košice, Словакия, 17/07/19. https://doi.org/10.1007/978-3-030-23247-4_18

APA

Ogawa, M., & Selivanov, V. (2019). On Classes of Regular Languages Related to Monotone WQOs. в Descriptional Complexity of Formal Systems (стр. 235-247). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11612). https://doi.org/10.1007/978-3-030-23247-4_18

Vancouver

Ogawa M, Selivanov V. On Classes of Regular Languages Related to Monotone WQOs. в Descriptional Complexity of Formal Systems. 2019. стр. 235-247. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-23247-4_18

Author

Ogawa, Mizuhito ; Selivanov, Victor. / On Classes of Regular Languages Related to Monotone WQOs. Descriptional Complexity of Formal Systems. 2019. стр. 235-247 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{963547a3133c488abf7e526378953e80,
title = "On Classes of Regular Languages Related to Monotone WQOs",
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.",
keywords = "Decidability, Difference hierarchy, Lattice of upper sets, Monotone WQO, Periodic extension, Regular language",
author = "Mizuhito Ogawa and Victor Selivanov",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-23247-4_18",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "235--247",
booktitle = "Descriptional Complexity of Formal Systems",
note = "21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019 ; Conference date: 17-07-2019 Through 19-07-2019",

}

RIS

TY - GEN

T1 - On Classes of Regular Languages Related to Monotone WQOs

AU - Ogawa, Mizuhito

AU - Selivanov, Victor

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Decidability

KW - Difference hierarchy

KW - Lattice of upper sets

KW - Monotone WQO

KW - Periodic extension

KW - Regular language

UR - http://www.scopus.com/inward/record.url?scp=85069440471&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-23247-4_18

DO - 10.1007/978-3-030-23247-4_18

M3 - Conference contribution

AN - SCOPUS:85069440471

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 235

EP - 247

BT - Descriptional Complexity of Formal Systems

T2 - 21st International Conference on Descriptional Complexity of Formal Systems, DCFS 2019

Y2 - 17 July 2019 through 19 July 2019

ER -

ID: 126994992