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”

A new algorithm for the determinisation of visibly pushdown automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00241054" target="_blank" >RIV/68407700:21240/15:00241054 - isvavai.cz</a>

  • Result on the web

    <a href="https://fedcsis.org/proceedings/2015/" target="_blank" >https://fedcsis.org/proceedings/2015/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.15439/2015F325" target="_blank" >10.15439/2015F325</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A new algorithm for the determinisation of visibly pushdown automata

  • Original language description

    Visibly pushdown automata are pushdown automata whose pushdown operations are determined by the input symbol, where the input alphabet is partitioned into three parts for push, pop and local pushdown operations. It is well known that nondeterministic visibly pushdown automata can be determinised. In this paper a new algorithm for the determinisation of nondeterministic visibly pushdown automata is presented. The algorithm improves the existing methods and can result in significantly smaller deterministic pushdown automata. This is achieved in a way that only necessary and accessible states and pushdown symbols are computed and constructed during the determinisation.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA13-03253S" target="_blank" >GA13-03253S: Text and Tree Structures Processing and Their Applications</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2015

  • 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

    Proceedings of the 2015 Federated Conference on Computer Science and Information Systems

  • ISBN

    978-83-60810-65-1

  • ISSN

    2300-5963

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    915-922

  • Publisher name

    IEEE

  • Place of publication

    New York

  • Event location

    Lodz

  • Event date

    Sep 13, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article