On Arch Factorization and Subword Universality for Words and Compressed Words

DOI10.1007/978-3-031-33180-0_21arXiv2304.11932OpenAlexW4381303258MaRDI QIDQ6134881

Unnamed Author, Philippe Schnoebelen

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.11932

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Existential Definability over the Subword Ordering ⋮ Simon's congruence pattern matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for distinguishing efficiently bit-strings by their subsequences
• Simon's theorem for scattered words
• Nearly \(k\)-universal words -- investigating a part of Simon's congruence
• \(k\)-spectra of weakly-\(c\)-balanced words
• Generalized Post embedding problems
• Absent subsequences in words
• Algorithmics on SLP-compressed strings: A survey
• Piecewise testable tree languages
• The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Deciding Piecewise Testable Separability for Regular Tree Languages
• Scattered Factor-Universality of Words
• Subsequences in bounded ranges: matching and analysis problems

This page was built for publication: On Arch Factorization and Subword Universality for Words and Compressed Words