Regularity of splicing languages
From MaRDI portal
Publication:1923604
Recommendations
Cites work
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- scientific article; zbMATH DE number 176945 (Why is no real title available?)
- scientific article; zbMATH DE number 1047931 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- On the splicing operation
- Splicing semigroups of dominoes and DNA
Cited in
(48)- A characterization of regular circular languages generated by marked splicing systems
- Splicing representations of stricly locally testable languages
- Splicing on tree-like structures
- Simple splicing systems
- Splicing in abstract families of languages
- DNA computing based on splicing: Universality results
- On the universality of Post and splicing systems
- Separating some splicing models.
- Aparallel digraphs and splicing machines
- The structure of reflexive regular splicing languages via Schützenberger constants
- Cut, paste and filter.
- Topics in the theory of DNA computing.
- On the splicing operation
- Time and space complexity for splicing systems
- On the overlap assembly of strings and languages
- Existence of constants in regular splicing languages
- Accepting splicing systems with permitting and forbidding words
- Complexity theory for splicing systems
- Regular splicing languages and subclasses
- Linear splicing and syntactic monoid
- An alternative definition of splicing
- On the power of circular splicing
- Splicing systems: accepting versus generating
- Deciding whether a regular language is generated by a splicing system
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
- scientific article; zbMATH DE number 4125033 (Why is no real title available?)
- Splicing systems and the Chomsky hierarchy
- scientific article; zbMATH DE number 2013200 (Why is no real title available?)
- scientific article; zbMATH DE number 1836433 (Why is no real title available?)
- scientific article; zbMATH DE number 1860701 (Why is no real title available?)
- Circular splicing and regularity
- scientific article; zbMATH DE number 1418477 (Why is no real title available?)
- Descriptional complexity of semi-simple splicing systems
- Non-preserving accepting splicing systems
- Regular Splicing Languages Must Have a Constant
- Deciding whether a regular language is generated by a splicing system
- Non-preserving splicing with delay
- DNA Splicing Systems
- Aspects of Molecular Computing
- Multiple splicing systems and the universal computability
- Formal properties of PA-matching
- On the regularity of circular splicing languages: a survey and new developments
- A characterization of (regular) circular languages generated by monotone complete splicing systems
- Descriptional Complexity of Semi-Simple Splicing Systems
- Splicing systems with targets are computationally universal
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
- Recognizing splicing languages: syntactic monoids and simultaneous pumping
- Accepting splicing systems
This page was built for publication: Regularity of splicing languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923604)
