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 条
  • [31] Checking Timed Buchi Automata Emptiness on Simulation Graphs
    Tripakis, Stavros
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2009, 10 (03)
  • [32] On-the-fly emptiness checks for generalized Buchi automata
    Couvreur, JM
    Duret-Lutz, A
    Poitrenaud, D
    MODEL CHECKING SOFTWARE, PROCEEDINGS, 2005, 3639 : 169 - 184
  • [33] DECIDING EMPTINESS FOR STACK AUTOMATA ON INFINITE-TREES
    HAREL, D
    RAZ, D
    INFORMATION AND COMPUTATION, 1994, 113 (02) : 278 - 299
  • [34] On Pebble Automata for Data Languages with Decidable Emptiness Problem
    Tan, Tony
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 712 - 723
  • [35] A set-membership approach to consensus problems with bounded measurement errors
    Garulli, Andrea
    Giannitrapani, Antonio
    47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008), 2008, : 2276 - 2281
  • [36] Set Automata
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (02) : 187 - 214
  • [37] Emptiness problems for integer circuits
    Barth, Dominik
    Beck, Moritz
    Dose, Titus
    Glasser, Christian
    Michler, Larissa
    Technau, Marc
    THEORETICAL COMPUTER SCIENCE, 2020, 824 (824-825) : 11 - 35
  • [38] SOME PROBLEMS IN AUTOMATA THEORY WHICH DEPEND ON THE MODELS OF SET THEORY
    Finkel, Olivier
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2011, 45 (04): : 383 - 397
  • [39] Set-π: Set Membership π-calculus
    Bruni, Alessandro
    Modersheim, Sebastian
    Nielson, Flemming
    Nielson, Hanne Riis
    2015 IEEE 28TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM CSF 2015, 2015, : 185 - 198
  • [40] Variations on parallel explicit emptiness checks for generalized Buchi automata
    Renault, E.
    Duret-Lutz, A.
    Kordon, F.
    Poitrenaud, D.
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2017, 19 (06) : 653 - 673
12345