@article{GASTIN201424,
    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{\"u}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.},
    Author = {Gastin, Paul and Monmege, Benjamin},
    File = {Adding pebbles to weighted automata - 1-s2.0-S0304397514001601-main.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {Weighted automata, Weighted expressions, Specification of weighted properties, Kleene--Sch{\"u}tzenberger theorem, Reusable pebbles},
    Note = {Weighted Automata:Theory and Applications},
    Pages = {24-44},
    Title = {Adding pebbles to weighted automata: Easy specification \& efficient evaluation},
    URL = {https://www.sciencedirect.com/science/article/pii/S0304397514001601},
    Volume = {534},
    Year = {2014},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397514001601},
    bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2014.02.034},
    date-added = {2022-08-24 10:50:53 +0200},
    date-modified = {2022-08-24 10:50:53 +0200},
    doi = {10.1016/j.tcs.2014.02.034}
}

@article{GASTIN201424, 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{\"u}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.}, Author = {Gastin, Paul and Monmege, Benjamin}, File = {Adding pebbles to weighted automata - 1-s2.0-S0304397514001601-main.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {Weighted automata, Weighted expressions, Specification of weighted properties, Kleene--Sch{\"u}tzenberger theorem, Reusable pebbles}, Note = {Weighted Automata:Theory and Applications}, Pages = {24-44}, Title = {Adding pebbles to weighted automata: Easy specification \& efficient evaluation}, URL = {https://www.sciencedirect.com/science/article/pii/S0304397514001601}, Volume = {534}, Year = {2014}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397514001601}, bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2014.02.034}, date-added = {2022-08-24 10:50:53 +0200}, date-modified = {2022-08-24 10:50:53 +0200}, doi = {10.1016/j.tcs.2014.02.034} }