Matching patterns with variables under Simon's congruence
From MaRDI portal
Publication:6623024
DOI10.1007/978-3-031-45286-4_12MaRDI QIDQ6623024
Stefan Siemer, Dirk Nowotka, Sung-Min Kim, Florin Manea, Tore Koß, Pamela Fleischmann, Max Wiedenhöft
Publication date: 23 October 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the parameterised complexity of string morphism problems
- Extended regular expressions: succinctness and decidability
- On a generalization of abelian equivalence and complexity of infinite words
- Patterns with bounded treewidth
- Another generalization of abelian equivalence: binomial complexity of infinite words
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Finding patterns common to a set of strings
- Document spanners: from expressive power to decision problems
- On universal partial words
- Universal partial words over non-binary alphabets
- Directed acyclic subsequence graph -- overview
- Complexity of universality and related problems for partially ordered NFAs
- On Simon's congruence closure of a string
- Deterministic regular expressions with back-references
- A logic for document spanners
- Pattern matching with variables: a multivariate complexity analysis
- A note on the complexity of matching patterns with variables
- Generalized function matching
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Absent subsequences in words
- Document spanners: a formal approach to information extraction
- Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
- A problem in arrangements
- The binomial equivalence classes of finite words
- Reducibility among Combinatorial Problems
- Scattered Factor-Universality of Words
- Pattern Matching with Variables
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
- Algorithms on Strings
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Existential length universality
- Matching patterns with variables under edit distance
- Ranking and Unranking k-Subsequence Universal Words
- Longest Common Subsequence with Gap Constraints
- On Arch Factorization and Subword Universality for Words and Compressed Words
- $\alpha$-$\beta$-Factorization and the Binary Case of Simon's Congruence
- Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints
- Matching patterns with variables under Simon's congruence
Related Items (2)
Matching patterns with variables under Simon's congruence ⋮ The equivalence problem of E-pattern languages with regular constraints is undecidable
This page was built for publication: Matching patterns with variables under Simon's congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623024)
