A note on the emptiness problem for alternating finite-memory automata

被引：1
|
作者：
Genkin, Daniel [1 ]
Kaminski, Michael [1 ]
Peterfreund, Liat [1 ]
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
来源：
THEORETICAL COMPUTER SCIENCE | 2014年 / 526卷
关键词：
Infinite alphabets; Alternating finite-memory automata; Alternating finite-memory tree automata; Emptiness problem;
D O I：
10.1016/j.tcs.2014.01.020
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present alternative relatively simple and self-contained proofs of decidability of the emptiness problems for one-register alternating finite-memory automata and one-register alternating finite-memory tree automata. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：97 / 107
页数：11
相关论文
共 50 条
  • [31] On stateless multihead automata: Hierarchies and the emptiness problem
    Ibarra, Oscar H.
    Karhumaki, Juhani
    Okhotin, Alexander
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (03) : 581 - 593
  • [32] On stateless multihead automata:: Hierarchies and the emptiness problem
    Ibarra, Oscar H.
    Karhumaki, Juhani
    Okhotin, Alexander
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 94 - +
  • [33] The Emptiness Problem for Tree Automata with Global Constraints
    Barguno, Luis
    Creus, Carles
    Godoy, Guillem
    Jacquemard, Florent
    Vacher, Camille
    25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010), 2010, : 263 - 272
  • [34] FINITE-MEMORY HYPOTHESIS TESTING - A CRITQUE
    CHANDRASEKARAN, B
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (04) : 494 - +
  • [35] Asymptotic optimality of finite-memory detection
    Ferrari, G
    Colavolpe, G
    Raheli, R
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 305 - 305
  • [36] A FINITE-MEMORY ADAPTIVE PATTERN RECOGNIZER
    IRANI, KB
    IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (01): : 2 - &
  • [37] SYNTHESIS OF MINIMAL FINITE-MEMORY AUTOMATIONS
    LADES, VI
    DOKLADY AKADEMII NAUK BELARUSI, 1982, 26 (11): : 1004 - 1007
  • [38] FINITE-STATE, FINITE-MEMORY MINIMUM PRINCIPLE
    SANDELL, NR
    ATHANS, M
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1978, 25 (02) : 289 - 305
  • [39] CONSTRUCTIONS FOR ALTERNATING FINITE AUTOMATA
    FELLAH, A
    JURGENSEN, H
    YU, S
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 35 (1-4) : 117 - 132
  • [40] An alternating hierarchy for finite automata
    Geffert, Viliam
    THEORETICAL COMPUTER SCIENCE, 2012, 445 : 1 - 24
12345