Ranking and Unranking k-Subsequence Universal Words

DOI10.1007/978-3-031-33180-0_4arXiv2304.04583OpenAlexW4381303907MaRDI QIDQ6134861

Duncan Adamson

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for distinguishing efficiently bit-strings by their subsequences
• Symmetry types of periodic sequences
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Subword histories and Parikh matrices
• Ranking binary unlabelled necklaces in polynomial time
• Nearly \(k\)-universal words -- investigating a part of Simon's congruence
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Absent subsequences in words
• Software Descriptions with Flow Expressions
• A Survey of Combinatorial Gray Codes
• The Complexity of Downward Closure Comparisons
• Scattered Factor-Universality of Words
• Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
• The Height of Piecewise-Testable Languages with Applications in Logical Complexity
• Ranking Bracelets in Polynomial Time.

This page was built for publication: Ranking and Unranking k-Subsequence Universal Words