Regular Tree Expressions and Deterministic Pushdown Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00183720" target="_blank" >RIV/68407700:21240/11:00183720 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Regular Tree Expressions and Deterministic Pushdown Automata
Original language description
Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by finite tree automata. 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 simple and straightforward way of transforming a regular tree expression to an equivalent height-deterministic pushdown automaton which reads input ranked and unranked ordered trees in postfix andpostfix bar notation, respectively.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
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
Proceeding of the 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
978-80-214-4305-1
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
70-77
Publisher name
Brno University of Technology
Place of publication
Brno
Event location
Lednice
Event date
Oct 14, 2011
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—