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.
Cite
@article{arxiv.cs/0410057,
title = {Generalized Counters and Reversal Complexity},
author = {M. V. Panduranga Rao},
journal= {arXiv preprint arXiv:cs/0410057},
year = {2007}
}
Comments
9 pages, no figures; Layout and content changed to some extent; Conference version