Pebble Weighted Automata and Weighted Logics
From MaRDI portal
Publication:5169971
DOI10.1145/2579819zbMath1291.03076OpenAlexW2072929390MaRDI QIDQ5169971
Benjamin Monmege, Benedikt Bollig, Paul Gastin, Marc Zeitoun
Publication date: 17 July 2014
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2579819
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items
Multi-weighted automata and MSO logic, Unnamed Item, Two-way pebble transducers for partial functions and their composition, Faster algorithms for quantitative verification in bounded treewidth graphs, Weighted automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook of weighted automata
- Weighted tree automata and weighted logics
- Classifying regular events in symbolic logic
- A logic for reasoning about time and reliability
- Counting quantifiers, successor relations, and logarithmic space
- On the power of tree-walking automata.
- Model checking games for the quantitative \(\mu \)-calculus
- Weighted logics for unranked tree automata
- Weighted picture automata and weighted logics
- Adding Pebbles to Weighted Automata
- Weighted Logics for Traces
- Counting CTL
- Transitive closure logic, nested tree walking automata, and XPath
- Pebble Weighted Automata and Transitive Closure Logics
- Expressive Power of Pebble Automata
- Weighted versus Probabilistic Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- Counting CTL
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Finite state machines for strings over infinite alphabets
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Logics with aggregate operators
- Complexity of Pebble Tree-Walking Automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Automata, Languages and Programming
- Logics with counting and local properties
