Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Nin 2014
DOI: 10.1145/2603088.2603118
|View full text |Cite
|
Sign up to set email alerts
|

Logical characterization of weighted pebble walking automata

Abstract: Weighted automata are a conservative quantitative extension of finite automata that enjoys applications, e.g., in language processing and speech recognition. Their expressive power, however, appears to be limited, especially when they are applied to more general structures than words, such as graphs. To address this drawback, weighted automata have recently been generalized to weighted pebble walking automata, which proved useful as a tool for the specification and evaluation of quantitative properties over wo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…A final direction would be to use logics instead of expressions, to describe in a less operational way the behaviour of weighted automata over monoids. Promising results have already been obtained in specific contexts, like non-looping automata walking (with pebbles) on words, trees or graphs [3], but a cohesive point of view via monoids is still lacking.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…A final direction would be to use logics instead of expressions, to describe in a less operational way the behaviour of weighted automata over monoids. Promising results have already been obtained in specific contexts, like non-looping automata walking (with pebbles) on words, trees or graphs [3], but a cohesive point of view via monoids is still lacking.…”
Section: Discussionmentioning
confidence: 99%
“…We define its indexed expression I(W ) as the Kleene expression over an alphabet being a finite subset of (K ∪ M ) × N, obtained by replacing each of its atomic subexpression ∈ K ∪ M by a letter ( , i) ∈ (K ∪ M ) × N where i is a unique index (starting from 0 for the leftmost one) associated with each atomic subexpression. For instance, with the weighted expression W = (2 (3,7)). From the indexed expression, one can recover the initial expression, by forgetting about the index.…”
Section: Weighted Expressionsmentioning
confidence: 99%
“…Other work on nested pebbles has appeared in, e.g., [2][3][4][5]13,14,[16][17][18][19]22,[26][27][28]30,32]. All results stated in this paper are effective.…”
mentioning
confidence: 87%