Pages that link to "Item:Q340586"
From MaRDI portal
The following pages link to Deciding whether a regular language is generated by a splicing system (Q340586):
Displaying 9 items.
- Splicing systems and the Chomsky hierarchy (Q428896) (← links)
- Recognizing splicing languages: syntactic monoids and simultaneous pumping (Q881578) (← links)
- Regularity of splicing languages (Q1923604) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- Theory of tailor automata (Q2315015) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- Regular Splicing Languages Must Have a Constant (Q5199955) (← links)
- Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application (Q5217119) (← links)