Pumping lemmas for weighted automata
Logic in Computer Science
2023-06-22 v4
Abstract
We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-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 and max-plus semirings.
Keywords
Cite
@article{arxiv.2001.06272,
title = {Pumping lemmas for weighted automata},
author = {Agnishom Chattopadhyay and Filip Mazowiecki and Anca Muscholl and Cristian Riveros},
journal= {arXiv preprint arXiv:2001.06272},
year = {2023}
}