Complement for Two-Way Alternating Automata

被引：3
|
作者：
Geffert, Viliam [1 ]
机构：
[1] Safarik Univ, Dept Comp Sci, Jesenna 5, Kosice 04154, Slovakia
来源：
COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018 | 2018年 / 10846卷
关键词：
Finite automata; Alternation; Descriptional complexity; FINITE AUTOMATA; COMPLEXITY;
D O I：
10.1007/978-3-319-90530-3_12
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the problem of converting a two-way alternating finite automaton (2AFA) with n states to a 2AFA accepting the complement of the original language. Complementing is trivial for halting 2AFAs, by inverting the roles of existential and universal decisions and the roles of accepting and rejecting states. However, since 2AFAs do not have resources to detect infinite loops by counting executed steps, the best construction known so far required Omega(4(n)) states. Here we shall show that the cost of complementing is polynomial in n. This complementary simulation does not eliminate infinite loops.
引用
收藏
页码：132 / 144
页数：13
相关论文
共 50 条
  • [41] Two-Way Non-uniform Finite Automata
    Frei, Fabian
    Hromkovic, Juraj
    Kralovic, Richard
    Kralovic, Rastislav
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2021, 2021, 12811 : 155 - 166
  • [42] Two-Way Parikh Automata with a Visibly Pushdown Stack
    Dartois, Luc
    Filiot, Emmanuel
    Talbot, Jean-Marc
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2019, 2019, 11425 : 189 - 206
  • [43] Two-way unary automata versus logarithmic space
    Geffert, Viliam
    Pighizzini, Giovanni
    INFORMATION AND COMPUTATION, 2011, 209 (07) : 1016 - 1025
  • [44] On the Size of Two-Way Reasonable Automata for the Liveness Problem
    Bianchi, Maria Paola
    Hromkovic, Juraj
    Kovac, Ivan
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (02) : 187 - 211
  • [45] Two-Way Finite Automata: Old and Recent Results
    Pighizzini, Giovanni
    FUNDAMENTA INFORMATICAE, 2013, 126 (2-3) : 225 - 246
  • [46] Two-Way Finite Automata: Old and Recent Results
    Pighizzini, Giovanni
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (90): : 3 - 20
  • [47] Two-Way Non-Uniform Finite Automata
    Frei, Fabian
    Hromkovic, Juraj
    Kralovic, Rastislav
    Kralovic, Richard
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2023, 34 (02N03) : 145 - 162
  • [48] Regularly extended two-way nondeterministic tree automata
    Brüggemann-Klein, A
    Wood, D
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2001, 2088 : 57 - 66
  • [49] Two-way finite automata with quantum and classical states
    Ambainis, A
    Watrous, J
    THEORETICAL COMPUTER SCIENCE, 2002, 287 (01) : 299 - 311
  • [50] On the Size of Two-Way Reasonable Automata for the Liveness Problem
    Bianchi, Maria Paola
    Hromkovic, Juraj
    Kovac, Ivan
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 120 - 131
12345