Zobrazeno 1 - 6
of 6
pro vyhledávání: '"68P05, 68W32"'
It is shown that a context-free grammar of size $m$ that produces a single string $w$ (such a grammar is also called a string straight-line program) can be transformed in linear time into a context-free grammar for $w$ of size $\mathcal{O}(m)$, whose
Externí odkaz:
http://arxiv.org/abs/1902.03568
In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the lexicographical
Externí odkaz:
http://arxiv.org/abs/1511.02612
Autor:
Rubinchik, Mikhail, Shur, Arseny M.
We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this struc
Externí odkaz:
http://arxiv.org/abs/1506.04862
Publikováno v:
FOCS
It is shown that a context-free grammar of size $m$ that produces a single string $w$ (such a grammar is also called a string straight-line program) can be transformed in linear time into a context-free grammar for $w$ of size $\mathcal{O}(m)$, whose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2420a4b06f2ca4400e76ee7f1307711d
Autor:
Arseny M. Shur, Mikhail Rubinchik
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319295152
IWOCA
Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Eur. J. Comb.
European Journal of Combinatorics
IWOCA
Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Eur. J. Comb.
European Journal of Combinatorics
We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this struc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82c7dd64844b0e8f372b3f18074300e6
https://doi.org/10.1007/978-3-319-29516-9_27
https://doi.org/10.1007/978-3-319-29516-9_27
In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a string into two at a given position, compare - finds the lexicographical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8c101e9f23542b3e958e2a3fed20384
http://arxiv.org/abs/1511.02612
http://arxiv.org/abs/1511.02612