AbstractFor all the Borel classes of finite order, we construct weakly acceptable sets of infinite trees representing these classes
AbstractWe introduce various types of ω-automata, top-down automata and bottom-up automata on infini...
AbstractOver the last decades the theory of automata on infinite objects has been an important sourc...
This paper concerns a generalization of finite automata, the “tree acceptors,” which have as their i...
AbstractFor all the Borel classes of finite order, we construct weakly acceptable sets of infinite t...
International audienceWe study the topological complexity of languages of Büchi automata on infinite...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
AbstractWe develop an algebraic language theory for languages of infinite trees. We define a class o...
Alternating automata on infinite trees induce operations on languages which do not preserve natural ...
An infinite tree is called thin if it contains only countably many infinite branches. Thin trees can...
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the ...
In the thesis we explore an algebraic approach to regular languages of infinite trees. We have decid...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
AbstractWe introduce various types of ω-automata, top-down automata and bottom-up automata on infini...
AbstractOver the last decades the theory of automata on infinite objects has been an important sourc...
This paper concerns a generalization of finite automata, the “tree acceptors,” which have as their i...
AbstractFor all the Borel classes of finite order, we construct weakly acceptable sets of infinite t...
International audienceWe study the topological complexity of languages of Büchi automata on infinite...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
International audienceThis article is inspired by two works from the early 90s. The first one is by ...
AbstractWe develop an algebraic language theory for languages of infinite trees. We define a class o...
Alternating automata on infinite trees induce operations on languages which do not preserve natural ...
An infinite tree is called thin if it contains only countably many infinite branches. Thin trees can...
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the ...
In the thesis we explore an algebraic approach to regular languages of infinite trees. We have decid...
AbstractFor a given ω-regular language A we establish an invariant property of the structure of fini...
AbstractWe introduce various types of ω-automata, top-down automata and bottom-up automata on infini...
AbstractOver the last decades the theory of automata on infinite objects has been an important sourc...
This paper concerns a generalization of finite automata, the “tree acceptors,” which have as their i...
DOI
Add to ORKG