From Regular Weighted Expressions to Finite Automata

DOI10.1007/3-540-45089-0_6MaRDI QIDQ3559799zbMATH OpenOpenAlexFDO

Authors E. Laugerotte, Faissal Ouardi, Djelloul Ziadi, Jean-Marc Champarnaud

Publication date 7 May 2010

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45089-0_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• From regular expressions to finite automata^∗
• From regular expressions to deterministic automata
• Regular expressions into finite automata
• An optimal construction of finite automata from regular expressions
• scientific article; zbMATH DE number 1948484
• scientific article; zbMATH DE number 3915652
• scientific article; zbMATH DE number 1472276
• Embedding finite automata within regular expressions
• Partial derivatives of regular expressions and finite automata constructions

Cited in

(7)

• scientific article; zbMATH DE number 1472276 (Why is no real title available?)
• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
• Computing weights
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• From Hadamard expressions to weighted rotating automata and back
• From Hadamard expressions to weighted rotating automata and back

This page was built for publication: From Regular Weighted Expressions to Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559799)