Abstract
We introduce real-counter automata, which are two-way finite automata augmented with counters that take real values. In contrast to traditional word automata that accept sequences of symbols, real-counter automata accept real words that are bounded and closed real intervals delimited by a finite number of markers. We study the membership and emptiness problems for one-way/two-way real-counter automata as well as those automata further augmented with other unbounded storage devices such as integer-counters and pushdown stacks. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Dang, Z., Ibarra, O. H., San Pietro, P., & Xie, G. (2004). Real-counter automata and their decision problems (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3328, 198–210. https://doi.org/10.1007/978-3-540-30538-5_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
