DROPS

Document

DOI: 10.4230/OASIcs.SLATE.2018.6

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

Authors: Tomás Pecka, Jan Trávnícek, Radomír Polách, and Jan Janousek

Published in: OASIcs, Volume 62, 7th Symposium on Languages, Applications and Technologies (SLATE 2018)

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.

Cite as

Tomás Pecka, Jan Trávnícek, Radomír Polách, and Jan Janousek. Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. In 7th Symposium on Languages, Applications and Technologies (SLATE 2018). Open Access Series in Informatics (OASIcs), Volume 62, pp. 6:1-6:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{pecka_et_al:OASIcs.SLATE.2018.6,
  author =	{Pecka, Tom\'{a}s and Tr\'{a}vn{\'\i}cek, Jan and Pol\'{a}ch, Radom{\'\i}r and Janousek, Jan},
  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 =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-072-9},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{62},
  editor =	{Henriques, Pedro Rangel and Leal, Jos\'{e} Paulo and Leit\~{a}o, Ant\'{o}nio Menezes and Guinovart, Xavier G\'{o}mez},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2018.6},
  URN =		{urn:nbn:de:0030-drops-92649},
  doi =		{10.4230/OASIcs.SLATE.2018.6},
  annote =	{Keywords: tree, regular tree expression, pushdown automaton}
}

@InProceedings{pecka_et_al:OASIcs.SLATE.2018.6,
  author =	{Pecka, Tom\'{a}s and Tr\'{a}vn{\'\i}cek, Jan and Pol\'{a}ch, Radom{\'\i}r and Janousek, Jan},
  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 =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-072-9},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{62},
  editor =	{Henriques, Pedro Rangel and Leal, Jos\'{e} Paulo and Leit\~{a}o, Ant\'{o}nio Menezes and Guinovart, Xavier G\'{o}mez},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2018.6},
  URN =		{urn:nbn:de:0030-drops-92649},
  doi =		{10.4230/OASIcs.SLATE.2018.6},
  annote =	{Keywords: tree, regular tree expression, pushdown automaton}
}

Search Results

Documents authored by Pecka, Tomás

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

Abstract

Cite as

Thanks for your feedback!

Could not send message