Splicing semigroups of dominoes and DNA
Discrete Mathematics
Sofic shifts with synchronizing presentations
Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Theory of Codes
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Discrete Applied Mathematics
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
| Hi-index | 0.00 |
In spite of wide investigations of finite splicing systems in formal language theory, basic questions, such as their characterization, remain unsolved. In search for understanding the class of finite splicing systems, it has been conjectured that a necessary condition for a regular language L to be a splicing language is that L must have a constant in the Schützenberger's sense. We prove this longstanding conjecture to be true. The result is based on properties of strongly connected components of the minimal deterministic finite state automaton for a regular splicing language.