On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F20%3A00338436" target="_blank" >RIV/68407700:21240/20:00338436 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-38919-2_47" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-38919-2_47</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-38919-2_47" target="_blank" >10.1007/978-3-030-38919-2_47</a>
Alternative languages
Result language
angličtina
Original language name
On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching
Original language description
We present a way of synchronizing finite tree automata: We define a synchronizing term and a k-local deterministic finite bottom–up tree automaton. Furthermore, we present a work–optimal parallel algorithm for parallel run of the deterministic k-local tree automaton in O(log n) time with [n/ log n] processors, for k <= log n, or in O(k) time with [n/ k] processors, for k >= log n, where n is the number of nodes of an input tree, on EREW PRAM. Finally, we prove that the deterministic finite bottom–up tree automaton that is used as a standard tree pattern matcher is k-local with respect to the height of a tree pattern.
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)
Others
Publication year
2020
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
SOFSEM 2020: Theory and Practice of Computer Science
ISBN
978-3-030-38918-5
ISSN
0302-9743
e-ISSN
—
Number of pages
11
Pages from-to
576-586
Publisher name
Springer
Place of publication
Cham
Event location
Limassol
Event date
Jan 20, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—