AbstractThe results of I. Guessarian (1983, Math. Systems Theory16, 237–263) are generalized to formal tree series. The following mechanisms are of equal power:(i) algebraic tree systems,(ii) pushdown tree automata,(iii) restricted pushdown tree automata
Trees are one of the fundamental and well-studied data structures in Computer Science. Arbology uses...
This is a book on weighted tree automata. We present the basic definitions and some of the important...
summary:We present a unified and systematic approach to basic principles of Arbology, a new algorith...
AbstractThe results of I. Guessarian (1983, Math. Systems Theory16, 237–263) are generalized to form...
In this survey we generalize some results on formal tree languages, tree grammars and tree automata ...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
AbstractThe aim of this paper is to deal with formal power series over a commutative semiring A. Gen...
AbstractWe investigate context-free (CF) series on trees with coefficients on a semiring; they are o...
AbstractWe introduce a link between automata of level k and tree-structures. This method leads to ne...
AbstractWe define and study Lindenmayerian algebraic sequences. These sequences are a generalization...
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of...
Trees are defined as mappings from tree structures (in the graph-theoretic sense) into sets of symbo...
We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a...
summary:A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is pr...
Trees are one of the fundamental and well-studied data structures in Computer Science. Arbology uses...
This is a book on weighted tree automata. We present the basic definitions and some of the important...
summary:We present a unified and systematic approach to basic principles of Arbology, a new algorith...
AbstractThe results of I. Guessarian (1983, Math. Systems Theory16, 237–263) are generalized to form...
In this survey we generalize some results on formal tree languages, tree grammars and tree automata ...
AbstractThis paper presents a new type of automaton called a tree pushdown automaton (a bottom-up tr...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
AbstractThe aim of this paper is to deal with formal power series over a commutative semiring A. Gen...
AbstractWe investigate context-free (CF) series on trees with coefficients on a semiring; they are o...
AbstractWe introduce a link between automata of level k and tree-structures. This method leads to ne...
AbstractWe define and study Lindenmayerian algebraic sequences. These sequences are a generalization...
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of...
Trees are defined as mappings from tree structures (in the graph-theoretic sense) into sets of symbo...
We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a...
summary:A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is pr...
Trees are one of the fundamental and well-studied data structures in Computer Science. Arbology uses...
This is a book on weighted tree automata. We present the basic definitions and some of the important...
summary:We present a unified and systematic approach to basic principles of Arbology, a new algorith...
DOI
Add to ORKG