Scattered Factor-Universality of Words
From MaRDI portal
Recommendations
Cites work
- \(k\)-spectra of weakly-\(c\)-balanced words
- Absoluteness of subword inequality is undecidable
- Algorithms for subsequence combinatorics
- Algorithms on strings. Translated from the 2001 French original
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Complexity of universality and related problems for partially ordered NFAs
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Connections between subwords and certain matrix mappings
- Descriptional and computational complexity of finite automata -- a survey
- Episturmian words and some constructions of de Luca and Rauzy
- Generalized Pascal triangle for binomial coefficients of words
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 7297889 (Why is no real title available?)
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- Introduction to algorithms.
- Languages ordered by the subword order
- Multivariate fine-grained complexity of longest common subsequence
- On the complexity of computations under varying sets of primitives
- On the index of Simon's congruence for piecewise testability
- On universal partial words
- Rich, Sturmian, and trapezoidal words
- Subword histories and Parikh matrices
- Testing Simon's congruence
- The complexity of downward closure comparisons
- The Complexity of Some Problems on Subsequences and Supersequences
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
- The height of piecewise-testable languages with applications in logical complexity
- The String-to-String Correction Problem
- Universal partial words over non-binary alphabets
Cited in
(32)- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- On Simon's congruence closure of a string
- \(k\)-spectra of weakly-\(c\)-balanced words
- Tropical representations and identities of the stylic monoid
- Absent subsequences in words
- On the Simon's congruence neighborhood of languages
- Absent Subsequences in Words
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- On Simon's congruence closure of a string
- Ranking and Unranking k-Subsequence Universal Words
- Longest Common Subsequence with Gap Constraints
- On Arch Factorization and Subword Universality for Words and Compressed Words
- Subsequences in bounded ranges: matching and analysis problems
- Existential Definability over the Subword Ordering
- Combinatorial algorithms for subsequence matching: a survey
- Simon's congruence pattern matching
- Matching patterns with variables under Simon's congruence
- Tight bounds for the number of absent subsequences
- Subsequence matching and analysis problems for automata with translucent letters
- Jumbled scattered factors
- Pattern mining under Simon's congruence
- k-universality of regular languages
- k-universality of regular languages revisited
- The edit distance to k-subsequence universality
- \(k\)-universality of regular languages
- Longest common subsequence with gap constraints
- On the piecewise complexity of words
- The edit distance to \(k\)-subsequence universality
- Efficiently testing Simon's congruence
- On strings having the same length-k substrings
- Subsequence matching and analysis problems for formal languages
- Scattered factor universality -- a survey
This page was built for publication: Scattered Factor-Universality of Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041246)
