Adding Pebbles to Weighted Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Adding Pebbles to Weighted Automata


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.


Other [cs.OH]

Dates and versions

hal-00776603 , version 1 (15-01-2013)



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⟩
89 View
0 Download



Gmail Facebook Twitter LinkedIn More