Semirings, automata, languages
Semirings, automata, languages
Rational series and their languages
Rational series and their languages
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 Recognizable and Rational Formal Power Series in Partially Commuting Variables
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
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)
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Finite-state transducers in language and speech processing
Computational Linguistics
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Theoretical Computer Science
Incomparability results for classes of polynomial tree series transformations
Journal of Automata, Languages and Combinatorics
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Minimizing deterministic weighted tree automata
Information and Computation
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Bisimulation minimisation for weighted tree automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
MAT learners for recognizable tree languages and tree series
Acta Cybernetica
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
Pushing for weighted tree automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Rational transformations and a kleene theorem for power series over rational monoids
Algebraic Foundations in Computer Science
| Hi-index | 0.00 |
In this paper we prove a Myhill-Nerode theorem for recognizable tree series over commutative semifields and thereby present a minimization of bottom-up finite state weighted tree automata over a commutative semifield, where minimal means with respect to the number of states among all equivalent, deterministic devices.