Abstract
We survey the properties of automata augmented with reversal-bounded counters. In particular, we discuss the closure/non-closure 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. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Ibarra, O. H. (2014). Automata with reversal-bounded counters: A survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 5–22). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
