Pebble Weighted Automata and Transitive Closure Logics

DOI10.1007/978-3-642-14162-1_49zbMath1288.68149OpenAlexW2096531026MaRDI QIDQ3587470

Paul Gastin, Benedikt Bollig, 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

Mathematics Subject Classification ID

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

Related Items

Adding pebbles to weighted automata: easy specification \& efficient evaluation, On weighted first-order logics with discounting, Quantitative Automata under Probabilistic Semantics, Pebble Weighted Automata and Weighted Logics, Unnamed Item, Weighted restarting automata, Bidirectional nested weighted automata, Characterizing weighted MSO for trees by branching transitive closure logics