Regular Tree Expressions and Deterministic Pushdown Automata

Result code in IS VaVaI

RIV/68407700:21240/11:00183720 - isvavai.cz

Result on the web

—

DOI - Digital Object Identifier

—

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

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)
S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

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

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

—