Pebble weighted automata and weighted logics

DOI10.1145/2579819MaRDI QIDQ5169971zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

formal power seriespebble automataquantitative propertiesweighted automataweighted logics

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Pebble weighted automata and transitive closure logics
• Adding pebbles to weighted automata
• Logical characterization of weighted pebble walking automata
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• Automata, Languages and Programming

Cites work

• A logic for reasoning about time and reliability
• Adding pebbles to weighted automata
• Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
• Automata, Languages and Programming
• Classifying regular events in symbolic logic
• Complexity of Pebble Tree-Walking Automata
• Counting CTL
• Counting CTL
• Counting quantifiers, successor relations, and logarithmic space
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decision Problems of Finite Automata Design and Related Arithmetics
• Expressive Power of Pebble Automata
• Finite state machines for strings over infinite alphabets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Handbook of weighted automata
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1408335 (Why is no real title available?)
• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Logics with aggregate operators
• Logics with counting and local properties
• Model checking games for the quantitative \(\mu \)-calculus
• Noncommutative rational series with applications
• On the power of tree-walking automata.
• Pebble weighted automata and transitive closure logics
• Transitive closure logic, nested tree walking automata, and XPath
• Weighted logics for nested words and algebraic formal power series
• Weighted Logics for Traces
• Weighted logics for unranked tree automata
• Weighted picture automata and weighted logics
• Weighted tree automata and weighted logics
• Weighted versus Probabilistic Logics

Cited in

(9)

• Faster algorithms for quantitative verification in bounded treewidth graphs
• Weighted automata
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• Adding pebbles to weighted automata
• Pebble weighted automata and transitive closure logics
• Logical characterization of weighted pebble walking automata
• scientific article; zbMATH DE number 1886325 (Why is no real title available?)
• scientific article; zbMATH DE number 7561720 (Why is no real title available?)
• Two-way pebble transducers for partial functions and their composition

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)