Max and sum semantics for alternating weighted automata

DOI10.1007/978-3-642-24372-1_2zbMATH Open1348.68116OpenAlexW193668954MaRDI QIDQ3172902FDOQ3172902

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) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cited In (7)

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

   Recommendations

• Alternating Weighted Automata 👍 👎
• Alternating weighted automata over commutative semirings 👍 👎
• Expressiveness and closure properties for quantitative languages 👍 👎
• Probabilistic Weighted Automata 👍 👎
• Quantitative Languages 👍 👎

This page was built for publication: Max and sum semantics for alternating weighted automata

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