Computing weights

DOI10.1007/978-3-642-39274-0_4MaRDI QIDQ5327480zbMATH OpenOpenAlexFDO

Authors Houda Abbad, E. Laugerotte

Publication date 7 August 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-39274-0_4

zbMATH Keywords

formal power series(partial) Conway semiringsrational weighted expressionsweighted recognition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70) Semirings (16Y60)

Recommendations

• scientific article; zbMATH DE number 5291306
• From Regular Weighted Expressions to Finite Automata
• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• An efficient best-trees algorithm for weighted tree automata over the tropical semiring
• Efficient enumeration of weighted tree languages over the tropical semiring

Cited in

(8)

• scientific article; zbMATH DE number 4016762 (Why is no real title available?)
• Computation of weighted capacity
• Using ranked semirings for representing morphology automata
• Algorithms and training for weighted multiset automata and regular expressions
• Context-free recognition with weighted automata
• Weighting of derivatives
• FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
• Efficient enumeration of weighted tree languages over the tropical semiring

This page was built for publication: Computing weights

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