Language recognition by two-way deterministic pushdown automata

被引：0
|
作者：
Lisovik, L.P.
Koval', D.A.
机构：
来源：
Kibernetika i Sistemnyj Analiz | 2004年 / 40卷 / 06期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
页码：177 / 181
相关论文
共 50 条
  • [41] A SIMPLICITY TEST FOR DETERMINISTIC PUSHDOWN-AUTOMATA
    OYAMAGUCHI, M
    INAGAKI, Y
    HONDA, N
    INFORMATION AND CONTROL, 1980, 47 (01): : 10 - 36
  • [42] On regular tree languages and deterministic pushdown automata
    Jan Janoušek
    Bořivoj Melichar
    Acta Informatica, 2009, 46 : 533 - 547
  • [43] The equivalence problem for deterministic pushdown automata is decidable
    Senizergues, G
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1997, 1256 : 671 - 681
  • [44] RESULT ON EQUIVALENCE PROBLEM FOR DETERMINISTIC PUSHDOWN AUTOMATA
    TANIGUCHI, K
    KASAMI, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (01) : 38 - 50
  • [45] On regular tree languages and deterministic pushdown automata
    Janousek, Jan
    Melichar, Borivoj
    ACTA INFORMATICA, 2009, 46 (07) : 533 - 547
  • [46] 2 DECIDABILITY RESULTS FOR DETERMINISTIC PUSHDOWN AUTOMATA
    LINNA, M
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (01) : 92 - 107
  • [47] DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC STATELESS PUSHDOWN AUTOMATA
    OYAMAGUCHI, M
    HONDA, N
    INFORMATION AND CONTROL, 1978, 38 (03): : 367 - 376
  • [48] 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
  • [49] Deterministic Pushdown Automata with Translucent Input Letters
    Kutrib, Martin
    Malcher, Andreas
    Mereghetti, Carlo
    Palano, Beatrice
    Raucci, Priscilla
    Wendlandt, Matthias
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2024, 2024, 14791 : 203 - 217
  • [50] On the transformation of two-way finite automata to unambiguous finite automata
    Petrov, Semyon
    Okhotin, Alexander
    INFORMATION AND COMPUTATION, 2023, 295
12345