Finite tree automata with cost functions
- 1 April 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 126 (1) , 113-142
- https://doi.org/10.1016/0304-3975(94)90271-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Monadic second-order evaluations on tree-decomposable graphsTheoretical Computer Science, 1993
- Single-valuedness of tree transducers is decidable in polynomial timeTheoretical Computer Science, 1992
- Decidable boundedness problems for sets of graphs generated by hyperedge-replacementTheoretical Computer Science, 1991
- On the finite degree of ambiguity of finite tree automataActa Informatica, 1989
- Code selection techniques: Pattern matching, tree parsing, and inversion of derivorsLecture Notes in Computer Science, 1988