Pages that link to "Item:Q1175793"
From MaRDI portal
The following pages link to Splicing semigroups of dominoes and DNA (Q1175793):
Displaying 40 items.
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- Splicing systems with targets are computationally universal (Q671404) (← links)
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages (Q847663) (← links)
- Recognizing splicing languages: syntactic monoids and simultaneous pumping (Q881578) (← links)
- Accepting splicing systems (Q974105) (← links)
- Splicing representations of stricly locally testable languages (Q1270777) (← links)
- Computing by splicing (Q1349864) (← links)
- Simple splicing systems (Q1392573) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Aparallel digraphs and splicing machines (Q1660276) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Conjugacy on partial words. (Q1853530) (← links)
- On the splicing operation (Q1923595) (← links)
- Regularity of splicing languages (Q1923604) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- Derivation languages and descriptional complexity measures of restricted flat splicing systems (Q2306014) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- Complexity theory for splicing systems (Q2455600) (← links)
- Regular splicing languages and subclasses (Q2484444) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- Restricted use of the splicing operation<sup>1</sup> (Q2710743) (← links)
- Splicing Systems: Accepting Versus Generating (Q3091439) (← links)
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (Q3526537) (← links)
- A remark on morphic sturmian words (Q4365012) (← links)
- Circular splicing and regularity (Q4825394) (← links)
- On the power of the splicing operation<sup>1</sup> (Q4870965) (← links)
- Descriptional Complexity of Semi-simple Splicing Systems (Q5041256) (← links)
- (Q5061519) (← links)
- The finest homophonic partition and related code concepts (Q5096920) (← links)
- DNA Splicing Systems (Q5452697) (← links)
- Matrix splicing system (Q5852139) (← links)
- Formal properties of PA-matching (Q5958115) (← links)
- Partial words and a theorem of Fine and Wilf revisited (Q5958314) (← links)
- Descriptional Complexity of Semi-Simple Splicing Systems (Q6169897) (← links)
