Pumping lemmas for weighted automataArticleAuthors: Agnishom Chattopadhyay

; Filip Mazowiecki ; Anca Muscholl ; Cristian Riveros

0009-0007-0462-8080##NULL##NULL##0000-0003-0832-116X
Agnishom Chattopadhyay;Filip Mazowiecki;Anca Muscholl;Cristian Riveros
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.
Volume: Volume 17, Issue 3
Published on: July 21, 2021
Accepted on: May 29, 2021
Submitted on: January 20, 2020
Keywords: Computer Science - Logic in Computer Science
Funding:
Source : OpenAIRE Graph- Counter Automata: Verification and Synthesis; Funder: UK Research and Innovation; Code: EP/M011801/1
- Counter Automata: Verification and Synthesis; Funder: UK Research and Innovation; Code: EP/M012298/1
- Challenges for Logic, Transducers and Automata; Funder: French National Research Agency (ANR); Code: ANR-16-CE40-0007