Pumping Lemmas for Weighted Automata
Filip Mazowiecki, Cristian Riveros · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018
We present three pumping lemmas for three classes of functions definable by fragments of weighted automata over the min-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of functions definable by unambiguous, finitely-ambiguous, polynomially-ambiguous weighted automata, and the full class of weighted automata is strict for the min-plus semiring.