Generalized Counters and Reversal Complexity

Simple item page
dc.creatorRao, M. V. Panduranga
dc.date2004-10-25
dc.date2006-06-27
dc.date.accessioned2026-07-07T06:38:06Z
dc.date.available2026-07-07T06:38:06Z
dc.descriptionWe generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.
dc.description9 pages, no figures; Layout and content changed to some extent; Conference version
dc.identifierhttps://arxiv.org/abs/cs/0410057
dc.identifierhttp://arxiv.org/abs/cs/0410057
dc.identifierpp.318-326, Proceedings of TAMC 2006, Beijing, China, Springer LNCS, 3959
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100617
dc.subjectComputational Complexity
dc.subjectF.1.1
dc.titleGeneralized Counters and Reversal Complexity
dc.typetext

Files

Collections

arXiv