License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2022.74
URN: urn:nbn:de:0030-drops-168729
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16872/
Go to the corresponding LIPIcs Volume Portal

Michaliszyn, Jakub ; Otop, Jan

Learning Deterministic Visibly Pushdown Automata Under Accessible Stack

pdf-format:
LIPIcs-MFCS-2022-74.pdf (0.7 MB)

Abstract

We study the problem of active learning deterministic visibly pushdown automata. We show that in the classical L^*-setting, efficient active learning algorithms are not possible. To overcome this difficulty, we propose the accessible stack setting, where the algorithm has the read and write access to the stack. In this setting, we show that active learning can be done in polynomial time in the size of the target automaton and the counterexamples provided by the teacher. As counterexamples of exponential size are inevitable, we consider an algorithm working with words in a compressed representation via (visibly) Straight-Line Programs. Employing compression allows us to obtain an algorithm where the teacher and the learner work in time polynomial in the size of the target automaton alone.

BibTeX - Entry

@InProceedings{michaliszyn_et_al:LIPIcs.MFCS.2022.74,
  author =	{Michaliszyn, Jakub and Otop, Jan},
  title =	{{Learning Deterministic Visibly Pushdown Automata Under Accessible Stack}},
  booktitle =	{47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
  pages =	{74:1--74:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-256-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{241},
  editor =	{Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16872},
  URN =		{urn:nbn:de:0030-drops-168729},
  doi =		{10.4230/LIPIcs.MFCS.2022.74},
  annote =	{Keywords: visibly pushdown automata, automata inference, minimization}
}

Keywords: visibly pushdown automata, automata inference, minimization
Collection: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Issue Date: 2022
Date of publication: 22.08.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI