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
Handbook of formal languages, vol. 3
Automata, Languages, and Machines
Automata, Languages, and Machines
On the Determinization of Weighted Finite Automata
SIAM Journal on Computing
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
Finite-state transducers in language and speech processing
Computational Linguistics
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Theoretical Computer Science
A better N-best list: practical determinization of weighted finite tree automata
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Weighted tree automata and weighted logics
Theoretical Computer Science
Compositions of tree series transformations
Theoretical Computer Science
Incomparability results for classes of polynomial tree series transformations
Journal of Automata, Languages and Combinatorics
Tree-Series-to-Tree-Series Transformations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Minimizing Deterministic Weighted Tree Automata
Language and Automata Theory and Applications
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
A Backward and a Forward Simulation for Weighted Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Minimizing deterministic weighted tree automata
Information and Computation
Cut sets as recognizable tree languages
Fuzzy Sets and Systems
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Weighted tree-walking automata
Acta Cybernetica
Learning deterministically recognizable tree series: revisited
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Myhill-Nerode theorem for recognizable tree series revisited
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Input products for weighted extended top-down tree transducers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Minimizing weighted tree grammars using simulation
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Pushing for weighted tree automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The power of tree series transducers of type i and II
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Hierarchies of tree series transformations revisited
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
Towards probabilistic acceptors and transducers for feature structures
SSST-6 '12 Proceedings of the Sixth Workshop on Syntax, Semantics and Structure in Statistical Translation
Hi-index | 0.00 |
We investigate the determinization of nondeterministic bottom-up/top-down finite state weighted tree automata over some semiring A and compare the resulting four classes of formal tree series with each other. In particular, for every bottom-up finite state weighted tree automaton over some semifield (i.e., a semiring which contains a multiplicative inverse for every nonzero element) we construct a deterministic bottom-up weighted tree automaton. This construction is called partial determinization, because it may lead to an automaton with an infinite set of states. We prove sufficient conditions under which the partial determinization produces a bottom-up finite state weighted tree automaton which is equivalent to the original one. Using this partial determinization we generalize well known theorems on classes of tree languages (cf. [14] Chapter II, Theorems 2.6 and 2.10, Example 2.11), viz if A is a commutative and locally finite semifield, then (i) nondeterministic bottom-up, (ii) deterministic bottom-up, and (iii) nondeterministic top-down finite state weighted tree automata are equally powerful. Moreover, if the input alphabet is not trivial, then deterministic top-down finite state weighted tree automata are strictly less powerful than the aforementioned classes.