The following pages link to (Q5576262):
Displaying 16 items.
- Simple splicing systems (Q1392573) (← links)
- Accepting networks of evolutionary processors with subregular filters (Q2254489) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- Concatenation-free languages (Q2357107) (← links)
- Networks of evolutionary processors: the power of subregular filters (Q2376983) (← links)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- Expressive Capacity of Concatenation Freeness (Q2947422) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- (Q4988161) (← links)
- Accepting networks of evolutionary processors with resources restricted and structure limited filters (Q5021112) (← links)
- Generative Capacity of Contextual Grammars with Subregular Selection Languages* (Q5164871) (← links)
- (Q5663752) (← links)
- Finite automata with undirected state graphs (Q5918649) (← links)
- Relations of contextual grammars with strictly locally testable selection languages (Q6186541) (← links)
- Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars (Q6204140) (← links)
- Remarks on context-free grammars with subregular control languages (Q6589853) (← links)