Weighted Automata and Weighted Logics on Infinite Words
From MaRDI portal
Publication:3617045
DOI10.1007/11779148_6zbMATH Open1227.68053OpenAlexW2167951248MaRDI QIDQ3617045FDOQ3617045
Authors: Manfred Droste, George Rahonis 
Publication date: 26 March 2009
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11779148_6
Recommendations
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Cited In (37)
- Weighted Muller tree automata and weighted logics
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
- Integer weighted automata on infinite words
- Weighted versus Probabilistic Logics
- Weighted recognizability over infinite alphabets
- Title not available (Why is that?)
- Definable transductions and weighted logics for texts
- Weighted automata and logics on infinite graphs
- Weighted automata and weighted logics with discounting
- Weighted Linear Dynamic Logic
- Weighted automata and weighted logics
- Weighted automata and weighted logics
- Monitor Logics for Quantitative Monitor Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bidirectional nested weighted automata
- A Weighted μ-Calculus on Words
- Weighted automata and logics on graphs
- Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted picture automata and weighted logics
- Weighted variable automata over infinite alphabets
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Automata-based axiom pinpointing
- Chains and Superchains for ω-Rational Sets, Automata and Semigroups
- A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem
- Weighted Automata, Formal Power Series and Weighted Logic
- Weighted Automata and Weighted Logics with Discounting
- Weight assignment logic
- A Nivat theorem for weighted picture automata and weighted MSO logic
- Automata-Based Axiom Pinpointing
- Weighted Timed MSO Logics
- MSO logics for weighted timed automata
- Automata, Languages and Programming
- Quantitative vs. weighted automata
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- The inclusion problem for weighted automata on infinite trees
- Weighted automata and weighted logics on infinite words
This page was built for publication: Weighted Automata and Weighted Logics on Infinite Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617045)
