A Note on Realtime One-Way Alternating and Deterministic Multi-Counter Automata

Tsunehiro YOSHINAGA  Katsushi INOUE  

IEICE TRANSACTIONS on Information and Systems   Vol.E85-D   No.2   pp.346-349
Publication Date: 2002/02/01
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section LETTER (Special Issue on Selected Papers from LA Symposium)
alternating multi-counter automata,  deterministic multi-counter automata,  one-way computation,  realtime computation,  computational complexity,  

Full Text: PDF(140.5KB)>>
Buy this Article

This paper investigates the accepting powers of one-way alternating and deterministic multi-counter automata operating in realtime. We partially solve the open problem posed in [4], and show that for each k1, there is a language accepted by a realtime one-way deterministic (k+3)-counter automaton, but not accepted by any realtime one-way alternating k-counter automaton.