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 条
  • [1] PUSHDOWN-AUTOMATA WITH REVERSAL-BOUNDED COUNTERS
    CHAN, TH
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (03) : 269 - 291
  • [2] On bounded languages and reversal-bounded automata
    Ibarra, Oscar H.
    Ravikumar, Bala
    INFORMATION AND COMPUTATION, 2016, 246 : 30 - 42
  • [3] SOLVABLE PROBLEMS FOR TRANSFORMERS WITH REVERSAL-BOUNDED COUNTERS
    LISOVIK, AP
    CYBERNETICS, 1985, 21 (03): : 275 - 284
  • [4] Unboundedness Problems for Machines with Reversal-Bounded Counters
    Baumann, Pascal
    D'Alessandro, Flavio
    Ganardi, Moses
    Ibarra, Oscar
    McQuillan, Ian
    Schuetze, Lia
    Zetzsche, Georg
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2023, 2023, 13992 : 240 - 264
  • [5] Reachability analysis of reversal-bounded automata on series–parallel graphs
    Rayna Dimitrova
    Rupak Majumdar
    Acta Informatica, 2018, 55 : 153 - 189
  • [6] COMPARISON OF THE POWER BETWEEN REVERSAL-BOUNDED ATMS AND REVERSAL-BOUNDED NTMS
    YAMAMOTO, H
    NOGUCHI, S
    INFORMATION AND COMPUTATION, 1987, 75 (02) : 144 - 161
  • [7] Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs
    Dimitrova, Rayna
    Majumdar, Rupak
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2015, (193): : 100 - 114
  • [8] Reachability analysis of reversal-bounded automata on series-parallel graphs
    Dimitrova, Rayna
    Majumdar, Rupak
    ACTA INFORMATICA, 2018, 55 (02) : 153 - 189
  • [9] On two-way nondeterministic finite automata with one reversal-bounded counter
    Dang, Z
    Ibarra, OH
    Sun, ZW
    THEORETICAL COMPUTER SCIENCE, 2005, 330 (01) : 59 - 79
  • [10] Reversal-bounded counter machines revisited
    Finkel, Alain
    Sangnier, Arnaud
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 323 - 334
12345