The following pages link to Regulated Grammars and Automata (Q5406167):
Displaying 14 items.
- Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets (Q1615413) (← links)
- Enhancement of automata with jumping modes (Q2278568) (← links)
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model (Q2675809) (← links)
- One-Sided Random Context Grammars: A Survey (Q2944900) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- On Basic Properties of Jumping Finite Automata (Q4639928) (← links)
- (Q5016368) (← links)
- Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (Q5164863) (← links)
- On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness (Q5859630) (← links)
- Membership Problem for Two-Dimensional General Row Jumping Finite Automata (Q5859631) (← links)
- Decidability of Right One-Way Jumping Finite Automata (Q5859648) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)
- Properties of right one-way jumping finite automata (Q5919708) (← links)
- The effect of jumping modes on various automata models (Q6155031) (← links)
