On Emptiness and Membership Problems for Set Automata

被引：3

作者：

Rubtsov, A. ^{[1
,2
]}

Vyalyi, M. ^{[1
,2
,3
]}

机构：

[1] Natl Res Univ Higher Sch Econ, Moscow, Russia

[2] Moscow Inst Phys & Technol, Moscow, Russia

[3] FRC CSC RAS, Dorodnicyn Comp Ctr, Moscow, Russia

来源：

COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018 | 2018年 / 10846卷

关键词：

D O I：

10.1007/978-3-319-90530-3_25

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider a computational model which is known as set automata. The set automata are one-way finite automata with an additional storage-the set. There are two kinds of set automata-the deterministic and the nondeterministic ones. We denote them as DSA and NSA respectively. The model was introduced by Kutrib et al. in 2014 in [2,3]. In this paper we characterize algorithmic complexity of the emptiness and membership problems for set automata. More definitely, we prove that both problems are PSPACE-complete for both kinds of set automata.

引用

页码：295 / 307

页数：13

共 50 条

[21] Sorting and doubling techniques for set partitioning and automata minimization problems
Ziadi, D
AUTOMATA IMPLEMENTATION, 1998, 1436 : 241 - 251
[22] Sorting and doubling techniques for set partitioning and automata minimization problems
Ziadi, D
THEORETICAL COMPUTER SCIENCE, 2000, 231 (01) : 75 - 87
[23] Testing membership for timed automata
Richard Lassaigne
Michel de Rougemont
Acta Informatica, 2023, 60 : 361 - 384
[24] On the emptiness of the stability set of order d
Mathieu Martin
Theory and Decision, 2002, 52 : 313 - 326
[25] On pebble automata for data languages with decidable emptiness problem
Tan, Tony
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (08) : 778 - 791
[26] Abstraction Refinement for Emptiness Checking of Alternating Data Automata
Iosif, Radu
Xu, Xiao
TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2018, PT II, 2018, 10806 : 93 - 111
[27] Efficient emptiness check for timed Büchi automata
Frédéric Herbreteau
B. Srivathsan
Igor Walukiewicz
Formal Methods in System Design, 2012, 40 : 122 - 146
[28] Checking Timed Büchi Automata Emptiness Efficiently
Stavros Tripakis
Sergio Yovine
Ahmed Bouajjani
Formal Methods in System Design, 2005, 26 : 267 - 292
[29] The emptiness problem for valence automata over graph monoids
Zetzsche, Georg
INFORMATION AND COMPUTATION, 2021, 277
[30] On the emptiness of the stability set of order d
Martin, M
THEORY AND DECISION, 2002, 52 (04) : 313 - 326

← 1 2 3 4 5 →