THE VALIDITY OF WEIGHTED AUTOMATA

DOI10.1142/S0218196713400146zbMath1290.68076WikidataQ64853925 ScholiaQ64853925MaRDI QIDQ2842025

Sylvain Lombardy, Jacques Sakarovitch

Publication date: 30 July 2013

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

summability; weighted automata; topological semiring; \(\varepsilon\)-transitions

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

54H13: Topological fields, rings, etc. (topological aspects)

Related Items

The net automaton of a rational expression, Automata and rational expressions, On Determinism and Unambiguity of Weighted Two-Way Automata, Conway and iteration hemirings Part 1

Cites Work

• Unnamed Item
• Unnamed Item
• The equivalence problem of multitape finite automata
• Monoides et semi-anneaux complets. (Complete monoids and semirings)
• Monoides et semi-anneaux continus. (Continuous monoids and semirings)
• Algebraic structures for transitive closure
• Derivatives of rational expressions with multiplicity
• Locally closed semirings
• Automata and languages generalized to \(\omega\)-continuous semirings
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Continuous Lattices and Domains
• An Introduction to Symbolic Dynamics and Coding