All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F18%3A00321835" target="_blank" >RIV/68407700:21240/18:00321835 - isvavai.cz</a>

  • Result on the web

    <a href="http://drops.dagstuhl.de/opus/volltexte/2018/9264/" target="_blank" >http://drops.dagstuhl.de/opus/volltexte/2018/9264/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4230/OASIcs.SLATE.2018.6" target="_blank" >10.4230/OASIcs.SLATE.2018.6</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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 those 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    7th Symposium on Languages, Applications and Technologies (SLATE 2018)

  • ISBN

    978-3-95977-072-9

  • ISSN

  • e-ISSN

    2190-6807

  • Number of pages

    12

  • Pages from-to

    "6:1"-"6:12"

  • Publisher name

    Dagstuhl Publishing,

  • Place of publication

    Saarbrücken

  • Event location

    Guimarães

  • Event date

    Jun 21, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article