Efficient weighted expressions conversion

DOI10.1051/ITA:2007035zbMath1157.68042OpenAlexW1994011843MaRDI QIDQ3515463

Djelloul Ziadi, Faissal Ouardi

Publication date: 29 July 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92872

zbMATH Keywords

formal seriesweighted automatonweighted regular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• The passing of a rational expression to a nondeterministic finite automaton
• Regular expressions into finite automata
• Characterization of Glushkov automata
• THE ABSTRACT THEORY OF AUTOMATA
• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time
• Glushkov Construction For Series: The Non Commutative Case
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

This page was built for publication: Efficient weighted expressions conversion