Since 2014
Dynamic Algorithms for the Dyck Languages
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Dynamic Algorithms for the Dyck Languages
|
|
| Creator |
Frandsen, Gudmund Skovbjerg
Husfeldt, Thore Miltersen, Peter Bro Rauhe, Theis Skyum, Søren |
|
| Description |
We study dynamic membership problems for the Dyck languages,the class of strings of properly balanced parentheses. We also study the Dynamic Word problem for the free group. We present deterministic algorithms and data structures which maintain a string under replacements of symbols, insertions, and deletions of symbols, and language membership queries. Updates and queries are handled in polylogarithmic time. We also give both Las Vegas- and Monte Carlo-type randomised algorithms to achieve better running times, and present lower bounds on the complexity for variants of the problems.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-01-01
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19503
10.7146/brics.v2i1.19503 |
|
| Source |
BRICS Report Series; No 1 (1995): RS-01 Dynamic Algorithms for the Dyck Languages
BRICS Report Series; No 1 (1995): RS-01 Dynamic Algorithms for the Dyck Languages 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19503/17125
|
|
| Rights |
Copyright (c) 2014 BRICS Report Series
|
|