Standard

Classifying -Regular Aperiodic k-Partitions. / Selivanov, Victor.

Descriptional Complexity of Formal Systems. 2020. стр. 193-205 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 12442).

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

Harvard

Selivanov, V 2020, Classifying -Regular Aperiodic k-Partitions. в Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 12442, стр. 193-205, 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, Vienna, Австрия, 24/08/20. https://doi.org/10.1007/978-3-030-62536-8_16

APA

Selivanov, V. (2020). Classifying -Regular Aperiodic k-Partitions. в Descriptional Complexity of Formal Systems (стр. 193-205). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 12442). https://doi.org/10.1007/978-3-030-62536-8_16

Vancouver

Selivanov V. Classifying -Regular Aperiodic k-Partitions. в Descriptional Complexity of Formal Systems. 2020. стр. 193-205. (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-62536-8_16

Author

Selivanov, Victor. / Classifying -Regular Aperiodic k-Partitions. Descriptional Complexity of Formal Systems. 2020. стр. 193-205 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{101e5df62bcb488e8438987cc9df9db3,
title = "Classifying -Regular Aperiodic k-Partitions",
abstract = "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.",
keywords = "Acceptor, Aperiodic k-partition, Fine hierarchy, Iterated labeled tree, Reducibility, Transducer",
author = "Victor Selivanov",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-62536-8_16",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "193--205",
booktitle = "Descriptional Complexity of Formal Systems",
note = "22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020 ; Conference date: 24-08-2020 Through 26-08-2020",

}

RIS

TY - GEN

T1 - Classifying -Regular Aperiodic k-Partitions

AU - Selivanov, Victor

PY - 2020/1/1

Y1 - 2020/1/1

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

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

KW - Acceptor

KW - Aperiodic k-partition

KW - Fine hierarchy

KW - Iterated labeled tree

KW - Reducibility

KW - Transducer

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

U2 - 10.1007/978-3-030-62536-8_16

DO - 10.1007/978-3-030-62536-8_16

M3 - Conference contribution

AN - SCOPUS:85097368803

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

SP - 193

EP - 205

BT - Descriptional Complexity of Formal Systems

T2 - 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020

Y2 - 24 August 2020 through 26 August 2020

ER -

ID: 126991279