Complexity results for two-way and multi-pebble automata and their logics

被引：0
|
作者：
Bar-Ilan Univ, Ramat-Gan, Israel [1 ]
机构：
来源：
Theor Comput Sci | / 2卷 / 161-184期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
20
引用
收藏
相关论文
共 50 条
  • [41] Partially Ordered Two-Way Buchi Automata
    Kufleitner, Manfred
    Lauser, Alexander
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 181 - 190
  • [42] Multihead two-way probabilistic finite automata
    Macarie, II
    THEORY OF COMPUTING SYSTEMS, 1997, 30 (01) : 91 - 109
  • [43] Improved complement for two-way alternating automata
    Viliam Geffert
    Christos A. Kapoutsis
    Mohammad Zakzok
    Acta Informatica, 2022, 59 : 619 - 669
  • [44] Multihead two-way probabilistic finite automata
    Department of Computer Science, SUNY Geneseo, Geneseo, NY 14454, United States
    不详
    Theory Comput. Syst., 1 (91-109):
  • [45] Multihead two-way probabilistic finite automata
    I. I. Macarie
    Theory of Computing Systems, 1997, 30 : 91 - 109
  • [46] Reasoning about the past with two-way automata
    Vardi, MY
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1998, 1443 : 628 - 641
  • [47] Improved complement for two-way alternating automata
    Geffert, Viliam
    Kapoutsis, Christos A.
    Zakzok, Mohammad
    ACTA INFORMATICA, 2022, 59 (05) : 619 - 669
  • [48] 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 - +
  • [49] Two-Way Automata over Locally Finite Semirings
    Dando, Louis-Marie
    Lombardy, Sylvain
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 62 - 74
  • [50] Longer Shortest Strings in Two-Way Finite Automata
    Krymski, Stanislav
    Okhotin, Alexander
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2020, 2020, 12442 : 104 - 116
12345