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 条
  • [41] Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints
    Creus, Carles
    Gascon, Adria
    Godoy, Guillem
    JOURNAL OF AUTOMATED REASONING, 2013, 51 (04) : 371 - 400
  • [42] A note on the emptiness problem for alternating finite-memory automata
    Genkin, Daniel
    Kaminski, Michael
    Peterfreund, Liat
    THEORETICAL COMPUTER SCIENCE, 2014, 526 : 97 - 107
  • [43] Membership questions for timed and hybrid automata
    Alur, R
    Kurshan, RP
    Viswanathan, M
    19TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 1998, : 254 - 263
  • [44] Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
    Chadha, Rohit
    Sistla, A. Prasad
    Viswanathan, Mahesh
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2017), 2017, 10203 : 231 - 247
  • [45] Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints
    Carles Creus
    Adrià Gascón
    Guillem Godoy
    Journal of Automated Reasoning, 2013, 51 : 371 - 400
  • [46] Emptiness check of powerset Buchi automata using inclusion tests
    Baarir, Souheib
    Duret-Lutz, Alexandre
    SEVENTH INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 2007, : 41 - +
  • [47] Advances in On-the-Fly Emptiness Checking Algorithms for Buchi Automata
    Zhao, Lu
    Zhang, Jianpei
    Yang, Jing
    2012 IEEE FIFTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2012, : 113 - 118
  • [48] Efficient On-the-Fly Emptiness Check for Timed Buchi Automata
    Herbreteau, Frederic
    Srivathsan, B.
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 : 218 - 232
  • [49] Language Emptiness of Continuous-Time Parametric Timed Automata
    Benes, Nikola
    Bezdek, Peter
    Larsen, Kim G.
    Srba, Jiri
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 69 - 81
  • [50] CONTROL OF OMEGA-AUTOMATA, CHURCHS PROBLEM, AND THE EMPTINESS PROBLEM FOR TREE OMEGA-AUTOMATA
    THISTLE, JG
    WONHAM, WM
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 367 - 381
12345