License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2011.603
URN: urn:nbn:de:0030-drops-30478
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3047/
Go to the corresponding LIPIcs Volume Portal

Parys, Pawel

Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata

pdf-format:
55.pdf (0.6 MB)

Abstract

We show that collapsible deterministic second level pushdown automata can recognize more languages than deterministic second level pushdown automata (without collapse). This implies that there exists a tree generated by a second level recursion scheme which is not generated by any second level safe recursion scheme.

BibTeX - Entry

@InProceedings{parys:LIPIcs:2011:3047,
  author =	{Pawel Parys},
  title =	{{Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
  pages =	{603--614},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Thomas Schwentick and Christoph D{\"u}rr},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3047},
  URN =		{urn:nbn:de:0030-drops-30478},
  doi =		{10.4230/LIPIcs.STACS.2011.603},
  annote =	{Keywords: pushdown automata}
}

Keywords: pushdown automata
Collection: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Issue Date: 2011
Date of publication: 11.03.2011

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