Max and Sum Semantics for Alternating Weighted Automata

DOI10.1007/978-3-642-24372-1_2zbMath1348.68116OpenAlexW193668954MaRDI QIDQ3172902

Orna Kupferman, Shaull Almagor

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Alternating weighted automata over commutative semirings ⋮ Fuzzy alternating Büchi automata over distributive lattices ⋮ A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings ⋮ Quantitative vs. weighted automata ⋮ What's decidable about weighted automata? ⋮ Fuzzy alternating automata over distributive lattices

This page was built for publication: Max and Sum Semantics for Alternating Weighted Automata