Generalized Counters and Reversal Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)
We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.
KeywordsFinite Automaton Generalize Counter Language Recognition Counter Machine Pushdown Automaton
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Mitrana, V., Stiebe, R.: The Accepting Power of Finite Automata over Groups, New Trends in Formal Languages, (39-48) 1997; also TUCS Technical Report No. 70 (1996)Google Scholar
© Springer-Verlag Berlin Heidelberg 2006