Panduranga Rao, MV (2006) Generalized Counters and Reversal Complexity. In: Theory And Applications Of Models Of Computation, Proceedings, 3959 . pp. 318-326.
![[img]](http://eprints.iisc.ac.in/style/images/fileicons/application_pdf.png) |
PDF
4.pdf - Published Version Restricted to Registered users only Download (384kB) | Request a copy |
Official URL: http://arxiv.org/PS_cache/cs/pdf/0410/0410057v2.pd...
Abstract
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.
| Item Type: | Journal Article |
|---|---|
| Publication: | Theory And Applications Of Models Of Computation, Proceedings |
| Series.: | Lecture Notes In Computer Science |
| Publisher: | Springer |
| Additional Information: | Copyright of this article belongs to Springer. |
| Keywords: | Computer Science - Computational Complexity. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 24 Mar 2009 09:34 |
| Last Modified: | 19 Sep 2010 04:56 |
| URI: | http://eprints.iisc.ac.in/id/eprint/17254 |
Actions (login required)
 |
View Item |
