Regular languages of infinite trees that are boolean combinations of open sets

Authors:
Mikołaj Bojańczyk;Thomas Place
Affiliations:
University of Warsaw, Poland;University of Warsaw, Poland
Venue:
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Year:
2012

Citing 4
Cited 1

Finite automata, formal logic, and circuit complexity

Finite automata, formal logic, and circuit complexity
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Algebra for Infinite Forests with an Application to the Temporal Logic EF

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory

Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study boolean (not necessarily positive) combinations of open sets. In other words, we study positive boolean combinations of safety and reachability conditions. We give an algorithm, which inputs a regular language of infinite trees, and decides if the language is a boolean combination of open sets.