Dynamic Algorithms for the Dyck Languages
DOI:
https://doi.org/10.7146/brics.v2i1.19503Resumé
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.
Downloads
Publiceret
1995-01-01
Citation/Eksport
Frandsen, G. S., Husfeldt, T., Miltersen, P. B., Rauhe, T., & Skyum, S. (1995). Dynamic Algorithms for the Dyck Languages. BRICS Report Series, 2(1). https://doi.org/10.7146/brics.v2i1.19503
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).