Generalized Counters and Reversal Complexity
M. V. Panduranga Rao
TL;DR
This paper introduces a generalized framework for counters and their reversal complexity, analyzing how these extended automata recognize languages and expanding understanding of their computational power.
Contribution
It presents a new generalized definition of counters and reversal complexity, exploring the capabilities of deterministic counter automata in language recognition.
Findings
Generalized counters extend traditional models.
Reversal complexity impacts automata power.
New bounds on language recognition capabilities.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · DNA and Biological Computing · Formal Methods in Verification