PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

DOI10.1142/S012905410700498XzbMath1142.68421OpenAlexW2060339170MaRDI QIDQ3503094

Dominique Lavenier, Mathieu Giraud, Philippe Veber

Publication date: 20 May 2008

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

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

zbMATH Keywords

weighted finite automatonchains of \(\varepsilon\)-transitionshard-ware accelerationpartial removalRemoval of \(\varepsilon\)-transitions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• A lower bound on the size of \(\varepsilon\)-free NFA corresponding to a regular expression
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Programming Techniques: Regular expression search algorithm
• A computational method for optimal control of a linear system by quadratic programming†

This page was built for publication: PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA