An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
Olivier Finkel (ELM)
TL;DR
This paper extends the Wagner hierarchy, originally for automata on infinite words, to blind counter automata with Muller acceptance, providing a precise and effective classification of their complexity.
Contribution
It introduces an effective extension of the Wagner hierarchy specifically for blind counter automata accepting infinite words with Muller conditions, and determines this hierarchy exactly.
Findings
The hierarchy extension is effective and precisely characterized.
Blind counter automata can be classified within this extended hierarchy.
The work advances understanding of automata complexity on infinite words.
Abstract
The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hierarchy.
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 · Formal Methods in Verification · Advanced Algebra and Logic