Finite tree automata with cost functions
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Tree automata for code selection
Acta Informatica
The transducers and formal tree series
Acta Cybernetica
A syntax directed compiler for ALGOL 60
Communications of the ACM
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
The MSO Logic-Automaton Connection in Linguistics
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Full Abstract Families of Tree Series I
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
The mathematics of statistical machine translation: parameter estimation
Computational Linguistics - Special issue on using large corpora: II
A statistical approach to language translation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A syntax-based statistical translation model
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Generalized2 sequential machine maps
Journal of Computer and System Sciences
Code selection by tree series transducers
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.01 |
Substitution operations on tree series are at the basis of systems of equations (over tree series) and tree series transducers. Tree series transducers seem to be an interesting transformation device in syntactic pattern matching. In this contribution, it is shown that o-substitution preserves recognizable tree series provided that the target tree series is linear and the semiring is idempotent, commutative, and continuous. This result is applied to prove that the range of the o-t-ts transformation computed by a linear recognizable tree series transducer is pointwise recognizable.