Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00352399" target="_blank" >RIV/68407700:21240/21:00352399 - isvavai.cz</a>
Result on the web
<a href="http://stringology.org/event/2021/p01.html" target="_blank" >http://stringology.org/event/2021/p01.html</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance
Original language description
We compare labeled ordered trees based on unit cost 1-degree edit distance that uses operations vertex relabeling, leaf insertion, and leaf deletion. Given an input tree T and a tree pattern P, we find all subtrees in T that match P with up to k errors. We show that this problem can be solved by finite automaton when T and P are represented in linear, prefix bar, notation. First, we solve this problem by a pushdown automaton. Then, we show that it can be transformed into a nondeterministic finite automaton due to its restricted use of the pushdown store. We also show a simulation of the nondeterministic finite automaton by dynamic programming.
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
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2021
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 Prague Stringology Conference 2021
ISBN
978-80-01-06869-4
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
1-15
Publisher name
CESKE VYSOKE UCENI TECHNICKE V PRAZE
Place of publication
Praha
Event location
Prague
Event date
Aug 30, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—