In this paper we present the main properties of the quasi-product concerning homomorphic and metric representation of tree automata, and compare the ...
Jul 7, 2003 · In this paper we present the main properties of the quasi-product concerning homomorphic and metric representation of tree automata, and compare ...
Section 2 defines some basic notions in term rewriting and tree automata and Section 3 recalls the tree automata completion algorithm and the related theorems.
The main properties of the quasi-product concerning homomorphic and metric representation of tree automata are presented, and the representing powers of ...
May 27, 2013 · Tree Automata Completion is a family of techniques for computing or approxi- mating the set of terms reachable by a rewriting relation.
This paper reviews a few aspects of recognizability in general alge braic structures and examines from this point of view several notions of trees.
This tool constructs approximations of reachable terms using the so-called tree automata completion algorithm. Starting from a set of initial terms. ( ...
A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines.
We consider rewriting of a regular language with a left-linear term rewriting system. We show two completeness theorems on equational tree automata completion.
We propose Lattice Tree Automata, an extended version of tree automata to represent complex data domains and their related opera- tions in an efficient manner.