A Weighted μ-Calculus on Words

DOI10.1007/978-3-642-02737-6_31zbMath1247.03042OpenAlexW1833559297MaRDI QIDQ3637241

Ingmar Meinecke

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_31

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items (4)

Weighted Linear Dynamic Logic ⋮ Unnamed Item ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Weighted versus Probabilistic Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Handbook of weighted automata
• Skew and infinitary formal power series
• Weighted automata and weighted logics
• On the definition of a family of automata
• Weighted Automata and Weighted Logics on Infinite Words
• ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
• Lattice Automata
• Automata, Languages and Programming
• CONCUR 2003 - Concurrency Theory
• Rudiments of \(\mu\)-calculus

This page was built for publication: A Weighted μ-Calculus on Words