DOI

We develop a theory of regular aperiodic k-partitions (for arbitrary that extends existing results for the regular k-partitions and for the fine hierarchy of regular aperiodic languages (which coincide with 2-partitions). In particular, we characterize the structure of Wadge degrees of regular aperiodic k-partitions, prove the decidability of many related problems, and discuss their complexity.
Язык оригиналаанглийский
Название основной публикацииDescriptional Complexity of Formal Systems
Страницы193-205
Число страниц13
DOI
СостояниеОпубликовано - 1 янв 2020
Событие22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020 - Vienna, Австрия
Продолжительность: 24 авг 2020 → 26 авг 2020

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

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

конференция

конференция22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020
Страна/TерриторияАвстрия
ГородVienna
Период24/08/20 → 26/08/20

ID: 126991279