Automata with Reversal-Bounded Counters: A Survey

被引：0
|
作者：
Ibarra, Oscar H. [1 ]
机构：
[1] Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA
来源：
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014 | 2014年 / 8614卷
关键词：
finite automaton; pushdown automaton; visibly pushdown automaton; transducer; context-free grammar; reversal-bounded counters; semilinear set; finitely-ambiguous; finite-valued; decidable; undecidable; FINITE-VALUED TRANSDUCERS; EQUIVALENCE PROBLEM; DIOPHANTINE EQUATIONS; DECISION-PROBLEMS; MACHINES; UNSOLVABILITY; VERIFICATION; REACHABILITY; COMPLEXITY;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We survey the properties of automata augmented with reversal-bounded counters. In particular, we discuss the closure/nonclosure properties of the languages accepted by these machines as well as the decidability/undecidability of decision problems concerning these devices. We also give applications to several problems in automata theory and formal languages.
引用
收藏
页码：5 / 22
页数：18
相关论文
共 50 条
  • [41] Eliminating Message Counters in Synchronous Threshold Automata
    Stoilkovska, Ilina
    Konnov, Igor
    Widder, Josef
    Zuleger, Florian
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2021, 2021, 12597 : 196 - 218
  • [42] Regular Expressions with Numerical Constraints and Automata with Counters
    Hovland, Dag
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2009, 2009, 5684 : 231 - 245
  • [43] Adding monotonic counters to automata and transition graphs
    Karianto, W
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 308 - 319
  • [44] AUTOMATA WITH MODULO COUNTERS AND NONDETERMINISTIC COUNTER BOUNDS
    Reidenbach, Daniel
    Schmid, Markus L.
    KYBERNETIKA, 2014, 50 (01) : 66 - 94
  • [45] On communicating automata with bounded channels
    Genest, Blaise
    Kusket, Dietrich
    Muscholl, Anca
    FUNDAMENTA INFORMATICAE, 2007, 80 (1-3) : 147 - 167
  • [46] Probabilistic automata of bounded ambiguity
    Fijalkow, Nathanael
    Riveros, Cristian
    Worrell, James
    INFORMATION AND COMPUTATION, 2022, 282
  • [47] On communicating automata with bounded channels
    IRISA/CNRS, Campus de Beaulieu, Rennes, France
    不详
    不详
    不详
    Fundam Inf, 2007, 1-3 (147-167):
  • [48] PUSHDOWN-AUTOMATA WITH BOUNDED NONDETERMINISM AND BOUNDED AMBIGUITY
    HERZOG, C
    LATIN '95: THEORETICAL INFORMATICS, 1995, 911 : 358 - 370
  • [49] Multiple counters automata, safety analysis and presburger arithmetic
    Comon, H
    Jurski, Y
    COMPUTER AIDED VERIFICATION, 1998, 1427 : 268 - 279
  • [50] RELATIONSHIPS BETWEEN PUSHDOWN AUTOMATA WITH COUNTERS AND COMPLEXITY CLASSES
    MONIEN, B
    MATHEMATICAL SYSTEMS THEORY, 1975, 9 (03): : 248 - 264
12345