Generalized Counters and Reversal Complexity

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages, no figures; Layout and content changed to some extent; Conference version

Keywords

Computational Complexity, F.1.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/100617

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0410057
 http://arxiv.org/abs/cs/0410057
 pp.318-326, Proceedings of TAMC 2006, Beijing, China, Springer LNCS, 3959

Collections

arXiv