Logical characterization of weighted pebble walking automata

DOI10.1145/2603088.2603118MaRDI QIDQ4635602zbMATHOpenAlexFDO

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

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603118

Mathematics Subject Classification ID

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

Recommendations

• Pebble weighted automata and transitive closure logics
• Pebble weighted automata and weighted logics
• Adding pebbles to weighted automata
• Adding pebbles to weighted automata: easy specification \& efficient evaluation
• Weighted automata and logics on graphs

Cited in

(5)

• Adding pebbles to weighted automata
• Expressive Power of Pebble Automata
• Pebble weighted automata and transitive closure logics
• Pebble weighted automata and weighted logics
• Adding pebbles to weighted automata: easy specification \& efficient evaluation

This page was built for publication: Logical characterization of weighted pebble walking automata

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