On Simon's congruence closure of a string

DOI10.1007/978-3-031-13257-5_10OpenAlexW4300422864MaRDI QIDQ2112187

Kai Salomaa, Sang-Ki Ko, Yo-Sub Han, Sung-Min Kim

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_10

zbMATH Keywords

finite automatastate complexityshortlex normal formsSimon's congruence

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On the Simon's congruence neighborhood of languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for distinguishing efficiently bit-strings by their subsequences
• The state complexities of some basic operations on regular languages
• State complexity of permutation and related decision problems on alphabetical pattern constraints
• State complexity of permutation on finite languages over a binary alphabet
• On the index of Simon's congruence for piecewise testability
• Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
• The binomial equivalence classes of finite words
• Scattered Factor-Universality of Words

This page was built for publication: On Simon's congruence closure of a string