Nearly \(k\)-universal words -- investigating a part of Simon's congruence
From MaRDI portal
Publication:2112180
DOI10.1007/978-3-031-13257-5_5OpenAlexW4301250397MaRDI QIDQ2112180
Annika Huch, Annika Mayrock, Pamela Fleischmann, Lukas Haschke, Dirk Nowotka
Publication date: 18 January 2023
Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_5
Related Items (4)
Ranking and Unranking k-Subsequence Universal Words ⋮ On Arch Factorization and Subword Universality for Words and Compressed Words ⋮ Subsequences in bounded ranges: matching and analysis problems ⋮ Simon's congruence pattern matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the word problem for syntactic monoids of piecewise testable languages.
- Normal forms under Simon's congruence
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- The smallest automaton recognizing the subwords of a text
- Reconstructing words from subwords in linear time
- On the index of Simon's congruence for piecewise testability
- Absent subsequences in words
- Linear work suffix array construction
- The Complexity of Some Problems on Subsequences and Supersequences
- On the distribution of the length of the longest increasing subsequence of random permutations
- The String-to-String Correction Problem
- Scattered Factor-Universality of Words
- The Height of Piecewise-Testable Languages with Applications in Logical Complexity
- Strict Linearizability and Abstract Atomicity
This page was built for publication: Nearly \(k\)-universal words -- investigating a part of Simon's congruence
