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 条
  • [31] GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
    Rao, M. V. Panduranga
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2008, 19 (06) : 1403 - 1412
  • [32] Generalized counters and reversal complexity
    Rao, M. V. Panduranga
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 318 - 326
  • [33] Eliminating Message Counters in Threshold Automata
    Stoilkovska, Ilina
    Konnov, Igor
    Widder, Josef
    Zuleger, Florian
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2020), 2020, 12302 : 196 - 212
  • [34] ACME: Automata with Counters, Monoids and Equivalence
    Fijalkow, Nathanael
    Kuperberg, Denis
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2014, 2014, 8837 : 163 - 167
  • [35] Visibly Pushdown Automata and Transducers with Counters
    Ibarra, Oscar H.
    FUNDAMENTA INFORMATICAE, 2016, 148 (3-4) : 291 - 308
  • [36] SURVEY OF COUNTERS
    NEWBERRY, JC
    ENGINEERING MATERIALS AND DESIGN, 1967, 10 (04): : 599 - &
  • [37] Bounded Parikh Automata
    Cadilhac, Michael
    Finkel, Alain
    McKenzie, Pierre
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 93 - 102
  • [38] BOUNDED PARIKH AUTOMATA
    Cadilhac, Michael
    Finkel, Alain
    Mckenzie, Pierre
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (08) : 1691 - 1709
  • [39] ALTERNATING FINITE AUTOMATA WITH COUNTERS AND STACK-COUNTERS OPERATING IN REALTIME
    YOSHINAGA, T
    INOUE, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (08) : 929 - 938
  • [40] Pushdown automata with bounded nondeterminism and bounded ambiguity
    Herzog, C
    THEORETICAL COMPUTER SCIENCE, 1997, 181 (01) : 141 - 157
12345