WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS

DOI10.1142/S0129054111009069zbMath1251.68130MaRDI QIDQ3224951

Ingmar Meinecke, Manfred Droste

Publication date: 13 March 2012

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

zbMATH Keywords

regular expressionsdiscountingaverageweighted automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (16)

Crisp-determinization of weighted tree automata over strong bimonoids ⋮ Weighted finite automata over hemirings ⋮ Weighted automata and weighted MSO logics for average and long-time behaviors ⋮ Weighted Linear Dynamic Logic ⋮ Automata with Auxiliary Weights ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Kleene theorem for weighted tree automata over tree valuation monoids ⋮ Weighted automata with storage ⋮ Weighted restarting automata ⋮ On deterministic weighted automata ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Weighted automata ⋮ THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES ⋮ Image-binary automata ⋮ Conway and iteration hemirings Part 2

Cites Work

• Handbook of weighted automata
• Skew and infinitary formal power series
• Derivatives of rational expressions with multiplicity
• Infinite fuzzy computations
• On the definition of a family of automata
• ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS

This page was built for publication: WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS