Absent subsequences in words
From MaRDI portal
Cites work
- Absent words in a sliding window with applications
- Absoluteness of subword inequality is undecidable
- Alignment-free sequence comparison using absent words
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Automata and forbidden words
- Computing DAWGs and minimal absent words in linear time for integer alphabets
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Connections between subwords and certain matrix mappings
- Directed acyclic subsequence graph -- overview
- 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 1962790 (Why is no real title available?)
- scientific article; zbMATH DE number 2051146 (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 7695992 (Why is no real title available?)
- scientific article; zbMATH DE number 7695995 (Why is no real title available?)
- Languages ordered by the subword order
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Multivariate fine-grained complexity of longest common subsequence
- On extended special factors of a word
- On the index of Simon's congruence for piecewise testability
- Patterns in permutations and words.
- Scattered Factor-Universality of Words
- Searching subsequences
- Sketching, streaming, and fine-grained complexity of (weighted) LCS
- 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 height of piecewise-testable languages with applications in logical complexity
- The level ancestor problem simplified
- The String-to-String Correction Problem
- The subtrace order and counting first-order logic
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Using minimal absent words to build phylogeny
- Word assembly through minimal forbidden words
- Words and forbidden factors
Cited in
(20)- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- Computing longest (common) Lyndon subsequences
- Absent Subsequences in Words
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- Computing longest Lyndon subsequences and longest common Lyndon subsequences
- Ranking and Unranking k-Subsequence Universal Words
- Longest Common Subsequence with Gap Constraints
- On Arch Factorization and Subword Universality for Words and Compressed Words
- Longest bordered and periodic subsequences
- Subsequence covers of words
- Subsequences in bounded ranges: matching and analysis problems
- Combinatorial algorithms for subsequence matching: a survey
- On problems related to absent subsequences
- Matching patterns with variables under Simon's congruence
- Fast algorithms for window accumulated subsequence matching problem
- k-universality of regular languages
- k-universality of regular languages revisited
- \(k\)-universality of regular languages
- Longest common subsequence with gap constraints
- Subsequence matching and analysis problems for formal languages
This page was built for publication: Absent subsequences in words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695493)
