Efficient weighted expressions conversion
Faissal Ouardi, Djelloul Ziadi (2008)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
J. Hromkovic et al. have given an elegant method to convert a regular expression of size into an -free nondeterministic finite automaton having states and transitions. This method has been implemented efficiently in 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 time.