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 条
12345