On Simon's congruence closure of a string
From MaRDI portal
Publication:6093575
DOI10.1016/J.TCS.2023.114078zbMATH Open1520.68059MaRDI QIDQ6093575FDOQ6093575
Authors: Sung-Min Kim, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa 
Publication date: 7 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- On Simon's congruence closure of a string
- On some family of congruences of null strings
- On Simon's string searching algorithm
- Strings of Congruent Primes
- On the Simon's congruence neighborhood of languages
- Efficient identification of \(k\)-closed strings
- On monotone clones of strings
- On deciding the confluence of a finite string-rewriting system on a given congruence class
- Completing a finite special string-rewriting system on the congruence class of the empty word
- scientific article; zbMATH DE number 1336330
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the index of Simon's congruence for piecewise testability
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- Reconstructing Words from Right-Bounded-Block Words
- Title not available (Why is that?)
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- State complexity of permutation on finite languages over a binary alphabet
- The binomial equivalence classes of finite words
- Testing Simon's congruence
- Scattered Factor-Universality of Words
- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words
- On the Simon's congruence neighborhood of languages
Cited In (5)
This page was built for publication: On Simon's congruence closure of a string
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093575)
