
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A prefix normal word is a binary word with the property that no substrin...
read it

BubbleFlipA New Generation Algorithm for Prefix Normal Words
We present a new recursive generation algorithm for prefix normal words....
read it

On Prefix Normal Words
We present a new class of binary words: the prefix normal words. They ar...
read it

On Arithmetically Progressed Suffix Arrays and related BurrowsWheeler Transforms
We characterize those strings whose suffix arrays are based on arithmeti...
read it

An Automatabased Abstract Semantics for String Manipulation Languages
In recent years, dynamic languages, such as JavaScript or Python, have f...
read it

Word forms  not just their lengths are optimized for efficient communication
The inverse relationship between the length of a word and the frequency ...
read it

A critical analysis of string APIs: The case of Pharo
Most programming languages, besides C, provide a native abstraction for ...
read it
Inside the Binary Reflected Gray Code: FlipSwap Languages in 2Gray Code Order
A flipswap language is a set S of binary strings of length n such that S ∪ 0^n is closed under two operations (when applicable): (1) Flip the leftmost 1; and (2) Swap the leftmost 1 with the bit to its right. Flipswap languages model many combinatorial objects including necklaces, Lyndon words, prefix normal words, left factors of kary Dyck words, and feasible solutions to 01 knapsack problems. We prove that any flipswap language forms a cyclic 2Gray code when listed in binary reflected Gray code (BRGC) order. Furthermore, a generic successor rule computes the next string when provided with a membership tester. The rule generates each string in the aforementioned flipswap languages in O(n)amortized per string, except for prefix normal words of length n which require O(n^1.864)amortized per string. Our work generalizes results on necklaces and Lyndon words by Vajnovski [Inf. Process. Lett. 106(3):9699, 2008].
READ FULL TEXT
Comments
There are no comments yet.