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 条
  • [1] Emptiness problems for distributed automata
    Kuusisto, Antti
    Reiter, Fabian
    INFORMATION AND COMPUTATION, 2020, 272
  • [2] Emptiness Problems for Distributed Automata
    Kuusisto, Antti
    Reiter, Fabian
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (256): : 210 - 222
  • [3] Emptiness and Universality Problems in Timed Automata with Positive Frequency
    Bertrand, Nathalie
    Bouyer, Patricia
    Brihaye, Thomas
    Stainer, Amelie
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT II, 2011, 6756 : 246 - 257
  • [4] The Complexity of Compressed Membership Problems for Finite Automata
    Artur Jeż
    Theory of Computing Systems, 2014, 55 : 685 - 718
  • [5] The Complexity of Compressed Membership Problems for Finite Automata
    Jez, Artur
    THEORY OF COMPUTING SYSTEMS, 2014, 55 (04) : 685 - 718
  • [6] COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA
    Lohrey, Markus
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (05) : 817 - 841
  • [7] On the Regular Emptiness Problem of Subzero Automata
    Michalewski, Henryk
    Mio, Matteo
    Bojanczyk, Mikolaj
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (223): : 1 - 23
  • [8] Simplifying Alternating Automata for Emptiness Testing
    Vargovcik, Pavol
    Holik, Lukas
    PROGRAMMING LANGUAGES AND SYSTEMS, APLAS 2021, 2021, 13008 : 243 - 264
  • [9] Certifying Emptiness of Timed Buchi Automata
    Wimmer, Simon
    Herbreteau, Frederic
    de Pol, Jaco van
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2020, 2020, 12288 : 58 - 75
  • [10] Checking timed Buchi automata emptiness efficiently
    Tripakis, S
    Yovine, S
    Bouajjani, A
    FORMAL METHODS IN SYSTEM DESIGN, 2005, 26 (03) : 267 - 292
12345