Simon's congruence pattern matching
From MaRDI portal
Publication:6204538
DOI10.1016/j.tcs.2024.114478MaRDI QIDQ6204538
Sang-Ki Ko, Yo-Sub Han, Sung-Min Kim
Publication date: 28 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Trees (05C05) Quantum computation (81P68) Pattern recognition, speech recognition (68T10) Length, area, volume, other geometric measure theory (28A75) Data structures (68P05) Strings (74K05) Theory of computing (68Qxx) Algorithms on strings (68W32) Real analysis on time scales or measure chains (26E70)
Cites Work
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Efficient algorithms for finding a longest common increasing subsequence
- Application of longest common subsequence algorithms to meshing of planar domains with quadrilaterals
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
- Scattered Factor-Universality of Words
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem
- On the Simon's congruence neighborhood of languages
- On Simon's congruence closure of a string
- Longest Common Subsequence with Gap Constraints
- On Arch Factorization and Subword Universality for Words and Compressed Words
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simon's congruence pattern matching
