On Combinatorial Generation of Prefix Normal Words

DOI10.1007/978-3-319-07566-2_7zbMath1407.68574arXiv1401.6346OpenAlexW3124029063MaRDI QIDQ5165591

Gabriele Fici, Péter Burcsi, Joe Sawada, Frank Ruskey, Zsuzsanna Lipták

Publication date: 30 June 2014

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.6346

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items (7)

Weighted prefix normal words: mind the gap ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ Generating a Gray code for prefix normal words in amortized polylogarithmic time per word ⋮ On prefix normal words and prefix normal forms ⋮ On infinite prefix normal words ⋮ The asymptotic number of prefix normal words ⋮ Bubble-flip -- a new generation algorithm for prefix normal words

This page was built for publication: On Combinatorial Generation of Prefix Normal Words