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.
Challenges for Logic, Transducers and Automata; Funder: French National Research Agency (ANR); Code: ANR-16-CE40-0007
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
Bibliographic References
4 Documents citing this article
Peter Kostolányi, 2022, Polynomially Ambiguous Unary Weighted Automata over Fields, Theory of Computing Systems, 67, 2, pp. 291-309, 10.1007/s00224-022-10107-7.
Peter Kostolányi, Lecture notes in computer science, Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields, pp. 209-223, 2022, 10.1007/978-3-031-09574-0_13.
Yusuke Inoue;Kenji Hashimoto;Hiroyuki Seki, Lecture notes in computer science, An Ambiguity Hierarchy of Weighted Context-Free Grammars, pp. 238-250, 2022, 10.1007/978-3-031-07469-1_19.
Andreas Maletti;Teodora Nasz;Kevin Stier;Markus Ulbricht, Lecture notes in computer science, Ambiguity Hierarchies for Weighted Tree Automata, pp. 140-151, 2021, 10.1007/978-3-030-79121-6_12.