Pebble weighted automata and weighted logics
From MaRDI portal
Publication:5169971
DOI10.1145/2579819zbMATH Open1291.03076OpenAlexW2072929390WikidataQ130892478 ScholiaQ130892478MaRDI QIDQ5169971FDOQ5169971
Authors: Benedikt Bollig, Paul Gastin, Benjamin Monmege, 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
Recommendations
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Handbook of weighted automata
- A logic for reasoning about time and reliability
- Transitive closure logic, nested tree walking automata, and XPath
- Noncommutative rational series with applications
- Classifying regular events in symbolic logic
- Decision Problems of Finite Automata Design and Related Arithmetics
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Logics with counting and local properties
- Weighted versus Probabilistic Logics
- Counting quantifiers, successor relations, and logarithmic space
- On the power of tree-walking automata.
- Automata, Languages and Programming
- Complexity of Pebble Tree-Walking Automata
- Finite state machines for strings over infinite alphabets
- Weighted logics for unranked tree automata
- Weighted tree automata and weighted logics
- Weighted Logics for Traces
- Weighted picture automata and weighted logics
- Expressive Power of Pebble Automata
- Title not available (Why is that?)
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Model checking games for the quantitative \(\mu \)-calculus
- Logics with aggregate operators
- Counting CTL
- Pebble weighted automata and transitive closure logics
- Weighted logics for nested words and algebraic formal power series
- Adding pebbles to weighted automata
- Counting CTL
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-way pebble transducers for partial functions and their composition
- Pebble weighted automata and transitive closure logics
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Weighted automata
- Multi-weighted automata and MSO logic
- Adding pebbles to weighted automata: easy specification \& efficient evaluation
- Adding pebbles to weighted automata
This page was built for publication: Pebble weighted automata and weighted logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169971)
