Add to ORKGAbstract. In this paper we give a structural characterization of three classes of tree automata. Namely, we shall homomorphically represent the classes of nilpotent, definite, and monotone tree automata by means of quasi-cascade-products of unary nilpotent and unary definite tree automata in the first two cases, and by means of products of simpler tree automata in the third case
A hierarchical type system for imperative programming languages gives rise to various computational ...
We examine the power of nondeterministic finite automata with acceptance of an input word defined ...
In the theory of finite automata minimal linear realizations of automata are of great interest. One ...
In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the...
Abstract. We consider several questions about monotone AC-tree automata, a class of equational tree ...
Abstract. We consider several questions about monotone AC-tree automata, a class of equational tree ...
AbstractWe propose a new algebraic framework to discuss and classify recognizable tree languages, an...
Abstract. A new tree automata framework, called equational tree au-tomata, is presented. In the newl...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
Abstract. We investigate the topological complexity of non Borel recognizable tree languages with re...
Finite tree automata on infinite trees which move from the root infinitely are investigated through ...
AbstractSequential compositions of tree automata, called selective products, are introduced as a con...
We propose a realizability semantics for automata on infinite trees, based on categories of games bu...
We consider co-Büchi tree automata along with both alternating and generalized paradigms, as a chara...
A hierarchical type system for imperative programming languages gives rise to various computational ...
We examine the power of nondeterministic finite automata with acceptance of an input word defined ...
In the theory of finite automata minimal linear realizations of automata are of great interest. One ...
In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the...
Abstract. We consider several questions about monotone AC-tree automata, a class of equational tree ...
Abstract. We consider several questions about monotone AC-tree automata, a class of equational tree ...
AbstractWe propose a new algebraic framework to discuss and classify recognizable tree languages, an...
Abstract. A new tree automata framework, called equational tree au-tomata, is presented. In the newl...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
Abstract. We investigate the topological complexity of non Borel recognizable tree languages with re...
Finite tree automata on infinite trees which move from the root infinitely are investigated through ...
AbstractSequential compositions of tree automata, called selective products, are introduced as a con...
We propose a realizability semantics for automata on infinite trees, based on categories of games bu...
We consider co-Büchi tree automata along with both alternating and generalized paradigms, as a chara...
A hierarchical type system for imperative programming languages gives rise to various computational ...
We examine the power of nondeterministic finite automata with acceptance of an input word defined ...
In the theory of finite automata minimal linear realizations of automata are of great interest. One ...