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 条
  • [1] Complement for two-way alternating automata
    Viliam Geffert
    Christos A. Kapoutsis
    Mohammad Zakzok
    Acta Informatica, 2021, 58 : 463 - 495
  • [2] Complement for two-way alternating automata
    Geffert, Viliam
    Kapoutsis, Christos A.
    Zakzok, Mohammad
    ACTA INFORMATICA, 2021, 58 (05) : 463 - 495
  • [3] Improved complement for two-way alternating automata
    Geffert, Viliam
    Kapoutsis, Christos A.
    Zakzok, Mohammad
    ACTA INFORMATICA, 2022, 59 (05) : 619 - 669
  • [4] Improved complement for two-way alternating automata
    Viliam Geffert
    Christos A. Kapoutsis
    Mohammad Zakzok
    Acta Informatica, 2022, 59 : 619 - 669
  • [5] Two-way alternating automata and finite models
    Bojanczyk, M
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 833 - 844
  • [6] The finite graph problem for two-way alternating automata
    Bojanczyk, M
    THEORETICAL COMPUTER SCIENCE, 2003, 298 (03) : 511 - 528
  • [7] Alternating two-way AC-tree automata
    Verma, Kumar Neeraj
    Goubault-Larrecq, Jean
    INFORMATION AND COMPUTATION, 2007, 205 (06) : 817 - 869
  • [8] Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
    Geffert, Viliam
    Okhotin, Alexander
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 291 - +
  • [9] A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
    Duparc, Jacques
    Facchini, Alessandro
    INFINITY IN LOGIC AND COMPUTATION, 2009, 5489 : 46 - 55
  • [10] Translation from Classical Two-Way Automata to Pebble Two-Way Automata
    Geffert, Viliam
    Istonova, L'ubomira
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (03): : 131 - 140
12345