An Effective Extension of the Wagner Hierarchy to Blind Counter Automata

Authors:
Olivier Finkel
Affiliations:
-
Venue:
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Year:
2001

Citing 13
Cited 3

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
X-automata on &ohgr;-words

Theoretical Computer Science
&ohgr;-languages

Handbook of formal languages, vol. 3
Fine hierarchy of regular &ohgr;-languages

Theoretical Computer Science
Decidability of bisimilarity for one-counter processes

Information and Computation
Computer science and the fine structure of Borel sets

Theoretical Computer Science
Pushdown processes: games and model-checking

Information and Computation - Special issue on FLOC '96
Efficient Verification Algorithms for One-Counter Processes

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Simulation and Bisimulation over One-Counter Processes

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Simulation Problems for One-Counter Machines

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Logical Specifications of Infinite Computations

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Formal languages and their relation to automata

Formal languages and their relation to automata

A hierarchical classification of first-order recurrent neural networks

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Blind Counter Automata on ω-Words

Fundamenta Informaticae
On the topological complexity of ω-languages of non-deterministic Petri nets

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.