| Issue |
RAIRO-Theor. Inf. Appl.
Volume 42, Number 2, April-June 2008
|
|
|---|---|---|
| Page(s) | 285 - 307 | |
| DOI | https://doi.org/10.1051/ita:2007035 | |
| Published online | 06 September 2007 | |
Efficient weighted expressions conversion
L.I.T.I.S., University of Rouen, France;
Faissal.Ouardi@univ-rouen.fr;
Djelloul.Ziadi@univ-rouen.fr
Received:
23
March
2005
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.