Splicing semigroups of dominoes and DNA
Discrete Mathematics
Handbook of theoretical computer science (vol. B)
Computing the Order of a Locally Testable Automaton
SIAM Journal on Computing
Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Computational Modeling for Genetic Splicing Systems
SIAM Journal on Computing
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Separating some splicing models
Information Processing Letters
Varieties Of Formal Languages
Theory of Codes
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
An alternative definition of splicing
Theoretical Computer Science
Complexity theory for splicing systems
Theoretical Computer Science
Theoretical Computer Science
Regular splicing languages must have a constant
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Splicing systems: accepting versus generating
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Solving SAT and HPP with accepting splicing systems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A decision procedure for reflexive regular splicing languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Recombinant DNA ,gene splicing as generative devices of formal languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
Recent developments in the theory of finite splicing systems have revealed surprising connections between long-standing notions in the formal language theory and splicing operation. More precisely, the syntactic monoid and Schützenberger constant have strong interaction with the investigation of regular splicing languages. This paper surveys results of structural characterization of classes of regular splicing languages based on the above two notions and discusses basic questions that motivate further investigations in this field.In particular, we improve the result in [6] that provides a structural characterization of reflexive symmetric splicing languages by showing that it can be extended to the class of all reflexive splicing languages: this is the larger class for which a characterization is known.