Recommendations
Cited in
(22)- Alternating complexity of counting first-order logic for the subword order
- Absent subsequences in words
- Scattered Factor-Universality of Words
- The subtrace order and counting first-order logic
- Complexity of counting first-order logic for the subword order
- Absent Subsequences in Words
- Unboundedness problems for machines with reversal-bounded counters
- Longest Common Subsequence with Gap Constraints
- Subsequences in bounded ranges: matching and analysis problems
- Existential Definability over the Subword Ordering
- Combinatorial algorithms for subsequence matching: a survey
- Preorder-constrained simulations for program refinement with effects
- Tight bounds for the number of absent subsequences
- Jumbled scattered factors
- Subsequences with generalised gap constraints: upper and lower complexity bounds
- k-universality of regular languages revisited
- The edit distance to k-subsequence universality
- Longest common subsequence with gap constraints
- Reachability and bounded emptiness problems of constraint automata with prefix, suffix and infix
- The edit distance to \(k\)-subsequence universality
- Efficiently testing Simon's congruence
- Subsequence matching and analysis problems for formal languages
This page was built for publication: Languages ordered by the subword order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289086)
