A gap property of deterministic tree languages.
type: Item
instance of: scholarly article
title: A gap property of deterministic tree languages.
zbMATH Open document ID: 1044.68120
DOI: 10.1016/S0304-3975(02)00452-8
author: Igor Walukiewicz
author: Damian Niwiński
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1965372
zbMATH Keywords: weak alternating automata
MaRDI profile type: Publication
cites work: Theμ-calculus alternation-depth hierarchy is strict on binary trees
cites work: Q4273664
cites work: Rudiments of \(\mu\)-calculus
cites work: The modal mu-calculus alternation hierarchy is strict
cites work: Computing the Rabin Index of a Parity Automaton
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: Q3323279
cites work: Topology and descriptive set theory
cites work: Q4818826
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Hierarchies of weak automata and weak monadic formulas
cites work: Q4726235
cites work: Alternating automata on infinite trees
cites work: Q3730012
cites work: Q4381391
cites work: Q4251069
cites work: Q3907077
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5616162
cites work: Deciding Equivalence of Finite Tree Automata
cites work: The Borel hierarchy is infinite in the class of regular sets of trees
cites work: Q3967525
cites work: Q4385530
cites work: Q4714446
cites work: Q2754186
cites work: Q4158997
cites work: Computing the rabin index of a regular language of infinite words
description: scientific article; zbMATH DE number 1965372