The following pages link to Splicing systems and regularity (Q4009701):
Displayed 13 items.
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- Recognizing splicing languages: syntactic monoids and simultaneous pumping (Q881578) (← links)
- Computing by splicing (Q1349864) (← links)
- Simple splicing systems (Q1392573) (← links)
- Splicing in abstract families of languages (Q1575672) (← links)
- On the universality of Post and splicing systems (Q1575914) (← links)
- On the splicing operation (Q1923595) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- Restricted use of the splicing operation<sup>1</sup> (Q2710743) (← links)
- Circular splicing and regularity (Q4825394) (← links)
- Descriptional Complexity of Semi-simple Splicing Systems (Q5041256) (← links)
- Descriptional Complexity of Semi-Simple Splicing Systems (Q6169897) (← links)