Skip to Main content Skip to Navigation
Conference papers

Adding Pebbles to Weighted Automata

Paul Gastin 1, 2 Benjamin Monmege 1, 2 
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : We extend weighted automata and weighted rational expressions with 2-way moves and (reusable) pebbles. We show with examples from natural language modeling and quantitative model-checking that weighted expressions and automata with pebbles are more expressive and allow much more natural and intuitive specifications than classical ones. We extend Kleene-Schützenberger theorem showing that weighted expressions and automata with pebbles have the same expressive power. We focus on an efficient translation from expressions to automata. We also prove that the evaluation problem for weighted automata can be done very efficiently if the number of (reusable) pebbles is low.
Document type :
Conference papers
Complete list of metadata
Contributor : Benedikt Bollig Connect in order to contact the contributor
Submitted on : Tuesday, January 15, 2013 - 5:43:10 PM
Last modification on : Wednesday, April 6, 2022 - 1:52:05 PM

Links full text



Paul Gastin, Benjamin Monmege. Adding Pebbles to Weighted Automata. Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), 2012, Porto, Portugal. pp.28-51, ⟨10.1007/978-3-642-31606-7_4⟩. ⟨hal-00776603⟩



Record views