License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.SLATE.2018.6
URN: urn:nbn:de:0030-drops-92649
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9264/
Go to the corresponding OASIcs Volume Portal

Pecka, Tomás ; Trávnícek, Jan ; Polách, Radomír ; Janousek, Jan

Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression

pdf-format:
OASIcs-SLATE-2018-6.pdf (0.5 MB)

Abstract

Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by a finite tree automaton as a standard model of computation. It was proved that the class of regular tree languages is a proper subclass of tree languages whose linear notations can be accepted by deterministic string pushdown automata. In this paper, we present a new algorithm for transforming regular tree expressions to equivalent real-time height-deterministic pushdown automata that accept the trees in their postfix notation.

BibTeX - Entry

@InProceedings{pecka_et_al:OASIcs:2018:9264,
  author =	{Tom{\'a}s Pecka and Jan Tr{\'a}vn{\'i}cek and Radom{\'i}r Pol{\'a}ch and Jan Janousek},
  title =	{{Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression}},
  booktitle =	{7th Symposium on Languages, Applications and Technologies  (SLATE 2018)},
  pages =	{6:1--6:12},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-072-9},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{62},
  editor =	{Pedro Rangel Henriques and Jos{\'e} Paulo Leal and Ant{\'o}nio Menezes Leit{\~a}o and Xavier G{\'o}mez Guinovart},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9264},
  URN =		{urn:nbn:de:0030-drops-92649},
  doi =		{10.4230/OASIcs.SLATE.2018.6},
  annote =	{Keywords: tree, regular tree expression, pushdown automaton}
}

Keywords: tree, regular tree expression, pushdown automaton
Collection: 7th Symposium on Languages, Applications and Technologies (SLATE 2018)
Issue Date: 2018
Date of publication: 13.07.2018

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