On Simon's congruence closure of a string
From MaRDI portal
Publication:6093575
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
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- scientific article; zbMATH DE number 2087227 (Why is no real title available?)
- An algorithm for distinguishing efficiently bit-strings by their subsequences
- On the Simon's congruence neighborhood of languages
- On the index of Simon's congruence for piecewise testability
- Reconstructing Words from Right-Bounded-Block Words
- Scattered Factor-Universality of Words
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- State complexity of permutation on finite languages over a binary alphabet
- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words
- Testing Simon's congruence
- The binomial equivalence classes of finite words
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)
