Efficient weighted expressions conversion
L.I.T.I.S., University of Rouen, France;
Accepted: 22 June 2007
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.
Mathematics Subject Classification: 03D15 / 68Q45
Key words: Formal languages and automata / complexity of computation
© EDP Sciences, 2007