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 条

[1] FINITE-MEMORY AUTOMATA
KAMINSKI, M
FRANCEZ, N
THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) : 329 - 363
[2] A note on emptiness for alternating finite automata with a one-letter alphabet
Jancar, Petr
Sawa, Zdenek
INFORMATION PROCESSING LETTERS, 2007, 104 (05) : 164 - 167
[3] Learning simple deterministic finite-memory automata
Sakamoto, H
ALGORITHMIC LEARNING THEORY, 1997, 1316 : 416 - 431
[4] Intractability of decision problems for finite-memory automata
Sakamoto, H
Ikeda, D
THEORETICAL COMPUTER SCIENCE, 2000, 231 (02) : 297 - 308
[5] FINITE-MEMORY SECRETARY PROBLEM
RUBIN, H
SAMUELS, SM
ANNALS OF PROBABILITY, 1977, 5 (04): : 627 - 635
[6] NOTE ON FINITE-MEMORY SEQUENTIAL MACHINES
MASSEY, JL
IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1966, EC15 (04): : 658 - &
[7] FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
Kaminski, Michael
Zeitlin, Daniel
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (05) : 741 - 760
[8] Generation of an Exhaustive Test for Finite-Memory Automata. I
Autom Remote Control, 2 (695):
[9] Generation of the Exhaustive Test for Finite-Memory Automata. II
Aksenova, G. A.
Khalchev, V. F.
Automation and Remote Control (English translation of Avtomatika i Telemekhanika), 58 (02):
[10] Generation of an exhaustive test for finite-memory automata. II
Aksenova, GA
Khalchev, VF
AUTOMATION AND REMOTE CONTROL, 1997, 58 (05) : 829 - 837

← 1 2 3 4 5 →