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

Authors

258

  1. MM
    Mehryar Mohri

    Google (United States), United States

    15 publications · 831 citations

    14

    h-index

  2. HV
    Heiko Vogler

    Technische Universität Dresden, Germany

    15 publications · 533 citations

    14

    h-index

  3. MD
    Manfred Droste

    Technische Universität Dresden, Germany

    11 publications · 704 citations

    11

    h-index

  4. TA
    Thomas A. Henzinger

    University of California, Berkeley, United States

    9 publications · 396 citations

    9

    h-index

  5. CA
    Cyril Allauzen

    Google (United States), United States

    9 publications · 392 citations

    9

    h-index

1–5 of 258

Venues

  1. Theoretical Computer Science

    10 publications · 719 citations

    10

    h-index

  2. arXiv (Cornell University)

    Repository · 9 publications · 168 citations

    9

    h-index

  3. International Journal of Foundations of Computer Science

    IJFCS · 8 publications · 269 citations

    8

    h-index

  4. Theory of Computing Systems

    5 publications · 154 citations

    5

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 5 publications · 61 citations

    5

    h-index

1–5