Amanote Research
Register
Sign In
Logical Characterization of Weighted Pebble Walking Automata
doi 10.1145/2603088.2603118
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2014
Authors
Benedikt Bollig
Paul Gastin
Benjamin Monmege
Marc Zeitoun
Publisher
ACM Press
Related search
Expressive Power of Pebble Automata
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Nested Weighted Automata
ACM Transactions on Computational Logic
Computational Mathematics
Theoretical Computer Science
Computer Science
Logic
Learning to Plan With Logical Automata
General Indexation of Weighted Automata
Random Generation of Deterministic Tree (Walking) Automata
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower-Bound Constrained Runs in Weighted Timed Automata
A Logical Characterization of Differential Privacy
Science of Computer Programming
Software
Towards Sampling and Simulation-Based Analysis of Featured Weighted Automata
Equivalences Between Ranked and Unranked Weighted Tree Automata via Binarization
