Article contents
Efficient weighted expressions conversion
Published online by Cambridge University Press: 06 September 2007
Abstract
J. Hromkovic et al. have given an elegant method to convert a regular expression of size n into an ε-free nondeterministic finite automaton having O(n) states and O(nlog2(n)) transitions. This method has been implemented efficiently in O(nlog2(n)) time by C. Hagenah and A. Muscholl. In this paper we extend this method to weighted regular expressions and we show that it can be achieved in O(nlog2(n)) time.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2007
References
- 1
- Cited by