Sciweavers

Share
FSTTCS
2004
Springer

Real-Counter Automata and Their Decision Problems

10 years 3 months ago
Real-Counter Automata and Their Decision Problems
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State University, Pullman, WA 99164, USA¨ Department of Computer Science, University of California, Santa Barbara, CA 93106, USA© Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italia 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/twoway real-counter automata as well as those automata further augmented with other unbounded storage devices such as integer-counters and pushdown stacks.
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, G
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where FSTTCS
Authors Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
Comments (0)
books