Tree compression pushdown automaton

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F12%3A00194119" target="_blank" >RIV/68407700:21240/12:00194119 - isvavai.cz</a>

Result on the web

<a href="http://www.kybernetika.cz/content/2012/3/429" target="_blank" >http://www.kybernetika.cz/content/2012/3/429</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Tree compression pushdown automaton

Original language description

A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with n nodes, the automaton has at most n+1 states, its transition function cardinality is at most 4n and there are 2n+1 pushdown store symbols. If hashing is used for storing automaton's transitions, thus removing a factor of log n, the construction of the automaton takes linear time and space with respect to the length n of the input tree(s). Our pushdown automaton construction can also be used for finding all subtree repeatswithout augmenting the overall complexity.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2012

Confidentiality

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

Name of the periodical

Kybernetika

ISSN

0023-5954

e-ISSN

—

Volume of the periodical

48

Issue of the periodical within the volume

3

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

24

Pages from-to

429-452

UT code for WoS article

000307856900006

EID of the result in the Scopus database

—