Pebble weighted automata and transitive closure logics

DOI10.1007/978-3-642-14162-1_49zbMATH Open1288.68149OpenAlexW2096531026MaRDI QIDQ3587470FDOQ3587470

Authors: Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_49

Recommendations

• Pebble weighted automata and weighted logics
• Logical characterization of weighted pebble walking automata
• Adding pebbles to weighted automata
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• Weighted automata and weighted logics

Mathematics Subject Classification ID

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

Cited In (13)

• Nested Pebbles and Transitive Closure
• Pebble weighted automata and weighted logics
• A pattern logic for automata with outputs
• On weighted first-order logics with discounting
• Logical characterization of weighted pebble walking automata
• Title not available (Why is that?)
• Characterizing weighted MSO for trees by branching transitive closure logics
• Bidirectional nested weighted automata
• A pattern logic for automata with outputs
• Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
• Weighted restarting automata
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• Adding pebbles to weighted automata

This page was built for publication: Pebble weighted automata and transitive closure logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587470)