Weighted Automata
Weighted Automata is a computational model that extends the class of finite automata by associating weights from a semiring to transitions, enabling the quantitative evaluation of input strings through a weighted sum over accepting paths.
161
Publications
5.7K
Citations
258
Authors
154
Institutions
Publications per year
2017–2026
26
161
Weighted automata and weighted logics
Manfred Droste, Paul Gastin · Theoretical Computer Science · 2007 · 224 citations
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger · ACM Transactions on Computational Logic · 2010 · 165 citations · Full text
1–5 of 161
258
14
h-index
14
h-index
11
h-index
9
h-index
9
h-index
1–5 of 258
154
Technische Universität Dresden
Dresden, Germany
16 h-index
30 publications
985 citations
Leipzig University
Leipzig, Germany
13 h-index
16 publications
909 citations
AT&T (United States)
Bedminster, United States
12 h-index
24 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
15 publications
869 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
9 h-index
13 publications
612 citations
Aalborg University
Aalborg, Denmark
8 h-index
22 publications
459 citations
Institute of Science and Technology Austria
Klosterneuburg, Austria
8 h-index
14 publications
622 citations
Google (United States)
Mountain View, United States
7 h-index
18 publications
783 citations
1–8 of 154
10 publications · 719 citations
10
h-index
Repository · 9 publications · 168 citations
9
h-index
IJFCS · 8 publications · 269 citations
8
h-index
5 publications · 154 citations
5
h-index
Repository · 5 publications · 61 citations
5
h-index
1–5