The following pages link to Regularity of splicing languages (Q1923604):
Displaying 39 items.
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- Splicing systems and the Chomsky hierarchy (Q428896) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← 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)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Splicing representations of stricly locally testable languages (Q1270777) (← links)
- Splicing on tree-like structures (Q1274596) (← links)
- Simple splicing systems (Q1392573) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- Separating some splicing models. (Q1603389) (← links)
- Aparallel digraphs and splicing machines (Q1660276) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- Cut, paste and filter. (Q1811127) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← 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)
- An alternative definition of splicing (Q2503274) (← links)
- On the power of circular splicing (Q2565850) (← links)
- Splicing Systems: Accepting Versus Generating (Q3091439) (← links)
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (Q3526537) (← links)
- Circular splicing and regularity (Q4825394) (← links)
- Descriptional Complexity of Semi-simple Splicing Systems (Q5041256) (← links)
- (Q5061519) (← links)
- Non-preserving splicing with delay (Q5297935) (← links)
- DNA Splicing Systems (Q5452697) (← links)
- Multiple splicing systems and the universal computability (Q5941559) (← links)
- Formal properties of PA-matching (Q5958115) (← links)
- On the regularity of circular splicing languages: a survey and new developments (Q5962067) (← links)
- Descriptional Complexity of Semi-Simple Splicing Systems (Q6169897) (← links)
