Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"balanced parentheses"”.

  1. Shift gray codes

    … 110100 for the binary tree corresponding to the balanced parentheses (()()). Given a string s = s1 s2 sn, the right-shift operation shift(s, i, j) replaces the substring si si+1..sj by si+1..sj si. In other words, si is right-shifted into position j by applying the permutation (j j−1 .. i) to the …

    uvic Repository record for Shift gray codes (opens in a new tab)

  2. Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures

    … problem, the problem of representing a string of balanced parentheses, the text retrieval problem, the problem of computing a permutation and its inverse, and the problem of representing a binary relation. These results are divided in two groups: lower bounds in the cell probe model and lower …

    waterloo Repository record for Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures (opens in a new tab)

  3. Complexity of Dyck-reachability in directed graphs

    … graph with edges labeled by either open or close parentheses, we claim that a vertex is Dyck-reachable from another if there is a path between these two vertices such that the string described by concatenating the edge labels of the path is a member of the Dyck language, i.e., the language of …

    uiuc Repository record for Complexity of Dyck-reachability in directed graphs (opens in a new tab)