Amanote Research

Amanote Research

  • Register
  • Sign In

Logical Characterization of Weighted Pebble Walking Automata

doi 10.1145/2603088.2603118

Full Text

Abstract

Available in

Date

January 1, 2014

Authors

Benedikt BolligPaul GastinBenjamin MonmegeMarc Zeitoun

Publisher

ACM Press


Related search

Expressive Power of Pebble Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Nested Weighted Automata

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2017English

Learning to Plan With Logical Automata

2019English

General Indexation of Weighted Automata

2004English

Random Generation of Deterministic Tree (Walking) Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Logical Characterization of Differential Privacy

Science of Computer Programming
Software
2020English

Lower-Bound Constrained Runs in Weighted Timed Automata

2012English

Towards Sampling and Simulation-Based Analysis of Featured Weighted Automata

2019English

Leveraging Weighted Automata in Compositional Reasoning About Concurrent Probabilistic Systems

ACM SIGPLAN Notices
Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy