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 条
  • [21] Complement for two-way alternating automata
    Viliam Geffert
    Christos A. Kapoutsis
    Mohammad Zakzok
    Acta Informatica, 2021, 58 : 463 - 495
  • [22] Alternation in two-way finite automata
    Kapoutsis, Christos
    Zakzok, Mohammad
    THEORETICAL COMPUTER SCIENCE, 2021, 870 (870) : 75 - 102
  • [23] TWO-WAY REPRESENTATIONS AND WEIGHTED AUTOMATA
    Lombardy, Sylvain
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2016, 50 (04): : 331 - 350
  • [24] Complementing two-way finite automata
    Geffert, Viliam
    Mereghetti, Carlo
    Pighizzini, Giovanni
    INFORMATION AND COMPUTATION, 2007, 205 (08) : 1173 - 1187
  • [25] TWO-WAY PROBABILISTIC AUTOMATA.
    Kuklin, Yu.I.
    Automatic Control and Computer Sciences, 1973, 7 (05) : 29 - 31
  • [26] Two-way pebble transducers for partial functions and their composition
    Joost Engelfriet
    Acta Informatica, 2015, 52 : 559 - 571
  • [27] Two-way pebble transducers for partial functions and their composition
    Engelfriet, Joost
    ACTA INFORMATICA, 2015, 52 (7-8) : 559 - 571
  • [28] Converting two-way nondeterministic unary automata into simpler automata
    Geffert, V
    Mereghetti, C
    Pighizzini, G
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 398 - 407
  • [29] On the transformation of two-way finite automata to unambiguous finite automata
    Petrov, Semyon
    Okhotin, Alexander
    INFORMATION AND COMPUTATION, 2023, 295
  • [30] Converting two-way nondeterministic unary automata into simpler automata
    Geffert, V
    Mereghetti, C
    Pighizzini, G
    THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 189 - 203
12345