AbstractWe define a class of monotonic functions whose least fixed points are weakly definable in the sense of Rabin. We use this property to give a new proof that vμ-definable sets of trees are recognized by Rabin's special automata
In this paper, we prove that for any language $L$ of finitely branching finite and infinite trees, t...
Abstract In this paper, we prove that for any language L of finitely branching finite and infinite ...
AbstractWe incorporate finite monoids into the theory of recognizability of ω-tree languages by Rabi...
AbstractWe define a class of monotonic functions whose least fixed points are weakly definable in th...
In 1970 [26], in Weakly definable relations and special automata, Math. Log. and Found. of Set Theor...
In 1970 [26], in Weakly definable relations and special automata, Math. Log. and Found. of Set Theor...
In 1970 [26], in Weakly definable relations and special automata, Math. Log. and Found. of Set Theor...
AbstractInfinite behavior of nondeterministic finite-state automata running over infinite trees or m...
AbstractRational omega-tree languages are defined by extending the notion of rational (or regular) e...
AbstractWe incorporate finite monoids into the theory of recognizability of ω-tree languages by Rabi...
AbstractWe study relations over ω-words using a representation by tree languages. An ω-word over an ...
AbstractIn this paper we show that the function associated with any closed or nonclosed term of the ...
We propose a realizability semantics for automata on infinite trees, based on categories of games bu...
The purpose of the present paper is to give an overview of our joint work with Zoltán Ésik, namely t...
This paper concerns a generalization of finite automata, the “tree acceptors,” which have as their i...
In this paper, we prove that for any language $L$ of finitely branching finite and infinite trees, t...
Abstract In this paper, we prove that for any language L of finitely branching finite and infinite ...
AbstractWe incorporate finite monoids into the theory of recognizability of ω-tree languages by Rabi...
AbstractWe define a class of monotonic functions whose least fixed points are weakly definable in th...
In 1970 [26], in Weakly definable relations and special automata, Math. Log. and Found. of Set Theor...
In 1970 [26], in Weakly definable relations and special automata, Math. Log. and Found. of Set Theor...
In 1970 [26], in Weakly definable relations and special automata, Math. Log. and Found. of Set Theor...
AbstractInfinite behavior of nondeterministic finite-state automata running over infinite trees or m...
AbstractRational omega-tree languages are defined by extending the notion of rational (or regular) e...
AbstractWe incorporate finite monoids into the theory of recognizability of ω-tree languages by Rabi...
AbstractWe study relations over ω-words using a representation by tree languages. An ω-word over an ...
AbstractIn this paper we show that the function associated with any closed or nonclosed term of the ...
We propose a realizability semantics for automata on infinite trees, based on categories of games bu...
The purpose of the present paper is to give an overview of our joint work with Zoltán Ésik, namely t...
This paper concerns a generalization of finite automata, the “tree acceptors,” which have as their i...
In this paper, we prove that for any language $L$ of finitely branching finite and infinite trees, t...
Abstract In this paper, we prove that for any language L of finitely branching finite and infinite ...
AbstractWe incorporate finite monoids into the theory of recognizability of ω-tree languages by Rabi...
DOI
Add to ORKG