License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2018.50
URN: urn:nbn:de:0030-drops-84984
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8498/
Go to the corresponding LIPIcs Volume Portal


Mazowiecki, Filip ; Riveros, Cristian

Pumping Lemmas for Weighted Automata

pdf-format:
LIPIcs-STACS-2018-50.pdf (0.6 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{mazowiecki_et_al:LIPIcs:2018:8498,
  author =	{Filip Mazowiecki and Cristian Riveros},
  title =	{{Pumping Lemmas for Weighted Automata}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{50:1--50:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Rolf Niedermeier and Brigitte Vall{\'e}e},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8498},
  URN =		{urn:nbn:de:0030-drops-84984},
  doi =		{10.4230/LIPIcs.STACS.2018.50},
  annote =	{Keywords: Weighted automata, regular functions over words, pumping lemmas}
}

Keywords: Weighted automata, regular functions over words, pumping lemmas
Seminar: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Issue Date: 2018
Date of publication: 20.02.2018


DROPS-Home | Imprint | Privacy Published by LZI