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 条
  • [11] Nested emptiness search for generalized Buchi automata
    Tauriainen, H
    FUNDAMENTA INFORMATICAE, 2006, 70 (1-2) : 127 - 154
  • [12] On stateless multihead automata:: Hierarchies and the emptiness problem
    Ibarra, Oscar H.
    Karhumaki, Juhani
    Okhotin, Alexander
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 94 - +
  • [13] On stateless multihead automata: Hierarchies and the emptiness problem
    Ibarra, Oscar H.
    Karhumaki, Juhani
    Okhotin, Alexander
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (03) : 581 - 593
  • [14] Efficient emptiness check for timed Buchi automata
    Herbreteau, Frederic
    Srivathsan, B.
    Walukiewicz, Igor
    FORMAL METHODS IN SYSTEM DESIGN, 2012, 40 (02) : 122 - 146
  • [15] 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
  • [16] When are emptiness and containment decidable for probabilistic automata?
    Daviaud, Laure
    Jurdzinski, Marcin
    Lazic, Ranko
    Mazowiecki, Filip
    Perez, Guillermo A.
    Worrell, James
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 119 : 78 - 96
  • [17] Nested emptiness search for generalized Buchi automata
    Tauriainen, H
    FOURTH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 2004, : 165 - 174
  • [18] Efficient Emptiness Check for Timed Buchi Automata
    Herbreteau, Frederic
    Srivathsan, B.
    Walukiewicz, Igor
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2010, 6174 : 148 - 161
  • [19] SET MEMBERSHIP CLASSIFICATION - A UNIFIED APPROACH TO GEOMETRIC INTERSECTION PROBLEMS
    TILOVE, RB
    IEEE TRANSACTIONS ON COMPUTERS, 1980, 29 (10) : 874 - 883
  • [20] Improved parameter bounds for set-membership EIV problems
    Cerone, Vito
    Piga, Dario
    Regruto, Diego
    INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, 2011, 25 (03) : 208 - 227
12345