Subsequence matching and analysis problems for formal languages
From MaRDI portal
Cites work
- \(k\)-universality of regular languages
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- A longest common subsequence algorithm suitable for similar text strings
- A survey on automata with translucent letters
- Absent subsequences in words
- Absent Subsequences in Words
- Absoluteness of subword inequality is undecidable
- Algorithmics on SLP-compressed strings: a survey
- Algorithms for the Longest Common Subsequence Problem
- Algorithms on Strings
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- An approach to software system modelling and analysis
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Combinatorial algorithms for subsequence matching: a survey
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Connections between subwords and certain matrix mappings
- Consequences of Faster Alignment of Sequences
- Directed acyclic subsequence graph -- overview
- Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints
- Effective constructions in well-partially-ordered free monoids
- Efficiently testing Simon's congruence
- Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds
- Globally deterministic CD-systems of stateless R-automata with window size 1
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (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?)
- Jump complexity of finite automata with translucent letters
- Jumping finite automata
- Languages ordered by the subword order
- Longest Common Subsequence with Gap Constraints
- Longest common subsequences of two random sequences
- Lower bounds based on the exponential time hypothesis
- Matching patterns with variables under Simon's congruence
- More on the Size of Higman-Haines Sets: Effective Constructions
- On Arch Factorization and Subword Universality for Words and Compressed Words
- On Context-Free Languages
- On the index of Simon's congruence for piecewise testability
- One-way jumping finite automata
- Ordering by Divisibility in Abstract Algebras
- Priority downward closures
- Scattered Factor-Universality of Words
- Searching subsequences
- Separability by piecewise testable languages and downward closures beyond subwords
- Sketching, streaming, and fine-grained complexity of (weighted) LCS
- Software Descriptions with Flow Expressions
- String matching with variable length gaps
- Subsequences in bounded ranges: matching and analysis problems
- Subsequences with gap constraints: complexity bounds for matching and analysis problems
- Subsequences with generalised gap constraints: upper and lower complexity bounds
- 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 edit distance to \(k\)-subsequence universality
- The subtrace order and counting first-order logic
- Tight hardness results for LCS and other sequence similarity measures
- Unshuffling a square is NP-hard
This page was built for publication: Subsequence matching and analysis problems for formal languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260643)
