Complexity of weak acceptance conditions in tree automata

Authors:
Jakub Neumann;Andrzej Szepietowski;Igor Walukiewicz
Affiliations:
Institute of Mathematics, University of Gdańsk, ul Wita Stwosza 57, 80952 Gdańsk, Poland;Institute of Mathematics, University of Gdańsk, ul Wita Stwosza 57, 80952 Gdańsk, Poland;LaBRI, Université Bordeaux I, Domaine Universitaire, batiment A30, 351, cours de la Libération, 33405 Talence Cedex, France
Venue:
Information Processing Letters
Year:
2002

Citing 6
Cited 5

Hierarchies of weak automata and weak monadic formulas

Theoretical Computer Science
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Alternating automata, the weak monadic theory of trees and its complexity

Theoretical Computer Science
Languages, automata, and logic

Handbook of formal languages, vol. 3
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Automata, Tableaux and Temporal Logics (Extended Abstract)

Proceedings of the Conference on Logic of Programs

Finitary winning in ω-regular games

ACM Transactions on Computational Logic (TOCL)
Faster algorithms for finitary games

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Concurrent games with ordered objectives

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Sofic Tree-Shifts

Theory of Computing Systems
Sofic Tree-Shifts

Theory of Computing Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong conditions that are defined in terms of states appearing infinitely often on the run. Weak conditions appear in the context of model-checking and translations of logical formalisms to automata. We study the complexity of the emptiness problem for tree automata with weak conditions. We also study the translations between automata with weak and strong conditions.