Efficient weighted expressions conversion

DOI10.1051/ITA:2007035MaRDI QIDQ3515463zbMATH OpenOpenAlexFDO

Authors Faissal Ouardi, Djelloul Ziadi

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, https://semanticscholar.org/paper/3ecafffedc6c0d72bf66c34ecd3ea6b7ced31caa

zbMATH Keywords

formal seriesweighted automatonweighted regular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Semirings and Formal Power Series
• Context-free recognition with weighted automata
• The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• Weighted tree-walking automata
• Noncommutative rational series with applications
• scientific article; zbMATH DE number 1472276
• On transformations of formal power series.
• Series-Parallel Automata and Short Regular Expressions
• scientific article; zbMATH DE number 5999572

Cites work

• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 619229 (Why is no real title available?)
• scientific article; zbMATH DE number 1786456 (Why is no real title available?)
• scientific article; zbMATH DE number 1929949 (Why is no real title available?)
• scientific article; zbMATH DE number 1929961 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• Characterization of Glushkov automata
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time
• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• Glushkov Construction For Series: The Non Commutative Case
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• The passing of a rational expression to a nondeterministic finite automaton
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

Cited in

(3)

• From Glushkov WFAs to \(\mathbb K\)-expressions
• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• From Hadamard expressions to weighted rotating automata and back

Describes a project that uses

Uses Software

• LANGAGE

This page was built for publication: Efficient weighted expressions conversion

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