Reset Complexity of Ideal Languages Over a Binary Alphabet

被引：6

作者：

Maslennikova, Marina ^{[1
]}

机构：

[1] Ural Fed Univ, Inst Nat Sci & Math, Ekaterinburg 620000, Russia

来源：

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2019年 / 30卷 / 6-7期

基金：

俄罗斯基础研究基金会;

关键词：

Ideal language; synchronizing automaton; reset word; reset complexity; state complexity; PSPACE-completeness; SYNCHRONIZING AUTOMATA;

D O I：

10.1142/S0129054119400343

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We prove PSPACE-completeness of checking whether a given ideal language serves as the language of reset words for some automaton with at most four states over a binary alphabet. We compare the reset complexity and the state complexity for languages related to slowly synchronizing automata.

引用

页码：1177 / 1196

页数：20

共 50 条

[31] Existence of words over a binary alphabet free from squares with mismatches
Kotlyarov, Nikita, V
DISCRETE MATHEMATICS AND APPLICATIONS, 2019, 29 (03): : 175 - 188
[32] On finding various minimal, maximal, and consistent sequences over a binary alphabet
Middendorf, M.
Theoretical Computer Science, 1995, 145 (1-2):
[33] Regular expressions for two-dimensional languages over one-letter alphabet
Anselmo, M
Giammarresi, D
Madonia, M
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 63 - 75
[34] Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Anselmo, Marcella
Madonia, Maria
THEORETICAL COMPUTER SCIENCE, 2009, 410 (16) : 1477 - 1485
[35] COMPLEXITY OF FINDING ALPHABET INDEXING
SHIMOZONO, S
MIYANO, S
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (01) : 13 - 18
[36] THE SHORTEST COMMON SUPERSEQUENCE PROBLEM OVER BINARY ALPHABET IS NP-COMPLETE
RAIHA, KJ
UKKONEN, E
THEORETICAL COMPUTER SCIENCE, 1981, 16 (02) : 187 - 198
[37] ON K-REPETITION FREENESS OF LENGTH UNIFORM MORPHISMS OVER A BINARY ALPHABET
KERANEN, V
DISCRETE APPLIED MATHEMATICS, 1984, 9 (03) : 297 - 300
[38] Parallel Repetition for All 3-Player Games over Binary Alphabet
Girish, Uma
Holmgren, Justin
Mittal, Kunal
Raz, Ran
Zhan, Wei
PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 998 - 1009
[39] State complexity of operations on two-way finite automata over a unary alphabet
Kunc, Michal
Okhotin, Alexander
THEORETICAL COMPUTER SCIENCE, 2012, 449 : 106 - 118
[40] On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
Alberto Del Pia
Silvia Di Gregorio
Algorithmica, 2023, 85 : 2189 - 2213

← 1 2 3 4 5 →