Rational series and their languages
Rational series and their languages
Handbook of formal languages, vol. 3
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Simpler and more general minimization for weighted finite-state automata
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
| Hi-index | 0.00 |
In this contribution the MYHILL-NERODE congruence relation on tree series is reviewed and a more detailed analysis of its properties is presented. It is shown that, if a tree series is deterministically recognizable over a zero-divisor free and commutative semiring, then the MYHILL-NERODE congruence relation has finite index. By [Borchardt: Myhill-Nerode Theorem for Recognizable Tree Series. LNCS 2710. Springer 2003] the converse holds for commutative semifields, but not in general. In the second part, a slightly adapted version of the MYHILL-NERODE congruence relation is defined and a characterization is obtained for all-accepting weighted tree automata over multiplicatively cancellative and commutative semirings.