FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA

DOI10.1142/S0129054104002698zbMath1098.68066OpenAlexW2015693819MaRDI QIDQ4667917

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

Publication date: 18 April 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002698

zbMATH Keywords

weighted automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

The net automaton of a rational expression ⋮ Efficient weighted expressions conversion ⋮ Unnamed Item ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions

Cites Work

• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• On the definition of a family of automata
• THE ABSTRACT THEORY OF AUTOMATA
• Subset construction complexity for homogeneous automata, position automata and ZPC-structures

This page was built for publication: FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA