On Prefix Normal Words

DOI10.1007/978-3-642-22321-1_20zbMath1221.68128arXiv1805.12405OpenAlexW95716193WikidataQ60691842 ScholiaQ60691842MaRDI QIDQ5199967

Gabriele Fici, Zsuzsanna Lipták

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

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

zbMATH Keywords

indexingcontext-free languagesLyndon wordsjumbled pattern matchingpermutation matchingParikh vectorspre-necklacesnon-standard pattern matching

Mathematics Subject Classification ID

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

Related Items (10)

Weighted prefix normal words: mind the gap ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ Binary jumbled string matching for highly run-length compressible texts ⋮ Abelian antipowers in infinite 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 ⋮ String Reconstruction from Substring Compositions

This page was built for publication: On Prefix Normal Words