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