Semirings, automata, languages
Semirings, automata, languages
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Enumerative combinatorics
Rational series and their languages
Rational series and their languages
Introduction to algorithms
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Direct and dual laws for automata with multiplicities
Theoretical Computer Science
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generic epsilon -Removal Algorithm for Weighted Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Enhancements of partitioning techniques for image compression using weighted finite automata
Theoretical Computer Science - Implementation and application automata
Rational Kernels: Theory and Algorithms
The Journal of Machine Learning Research
Derivatives of rational expressions with multiplicity
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we introduce the notion of Thompson weighted automaton. We show that an ε-free automaton constructed from the Thompson weighted automaton for a regular weighted expression E can be computed in quadratic time on the size of E. Moreover the coefficient of a word u in the noncommutative formal series associated to E, can be computed in time O(∣u∣ × &mis;E∣).