The following pages link to (Q5588662):
Displaying 50 items.
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- On external contextual grammars with subregular selection languages (Q443738) (← links)
- Contextual array grammars and array P systems (Q499706) (← links)
- Bounded hairpin completion (Q553314) (← links)
- Computational power of insertion-deletion (P) systems with rules of size two (Q553921) (← links)
- P systems with minimal insertion and deletion (Q616500) (← links)
- Matrix insertion-deletion systems (Q714867) (← links)
- Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata (Q860892) (← links)
- Degrees of non-monotonicity for restarting automata (Q861249) (← links)
- A note on ambiguity of internal contextual grammars (Q861285) (← links)
- Fundamental methodological issues of syntactic pattern recognition (Q903109) (← links)
- On the weight of universal insertion grammars (Q924156) (← links)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- On branching and looping. I (Q1134530) (← links)
- Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages (Q1160495) (← links)
- On representing recursively enumerable languages by internal contextual languages (Q1275069) (← links)
- Characterizations of recursively enumerable languages by means of insertion grammars (Q1275078) (← links)
- On computational complexity of contextual languages (Q1391136) (← links)
- On path-controlled insertion-deletion systems (Q1713412) (← links)
- Context-free insertion-deletion systems (Q1763721) (← links)
- On the splicing operation (Q1923595) (← links)
- Remarks on external contextual grammars with selection (Q1998866) (← links)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages (Q1998879) (← links)
- Universal insertion grammars of size two (Q2004002) (← links)
- Parallel contextual array insertion deletion P systems and tabled matrix grammars (Q2055828) (← links)
- Contextual array grammars with matrix control, regular control languages, and tissue P systems control (Q2358676) (← links)
- Sorted dependency insertion grammars (Q2368947) (← links)
- Computational completeness of path-structured graph-controlled insertion-deletion systems (Q2399250) (← links)
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion (Q2819137) (← links)
- Maximally Parallel Contextual String Rewriting (Q2827840) (← links)
- Contextual Array Grammars with Matrix and Regular Control (Q2829974) (← links)
- Circular Post Machines and P Systems with Exo-insertion and Deletion (Q2890284) (← links)
- Non-isometric Contextual Array Grammars with Regular Control and Local Selectors (Q2945879) (← links)
- Natural Language Processing, Moving from Rules to Data (Q2988808) (← links)
- Context Insertions (Q3009334) (← links)
- Contextual grammars vs. context-free algebras (Q3318127) (← links)
- (Q3486871) (← links)
- Iterative Learning of Simple External Contextual Languages (Q3529934) (← links)
- Further Results on Insertion-Deletion Systems with One-Sided Contexts (Q3540125) (← links)
- Bounded Hairpin Completion (Q3618601) (← links)
- (Q3926059) (← links)
- (Q4176989) (← links)
- From Contextual Grammars to Range Concatenation Grammars (Q4923554) (← links)
- (Q5016372) (← links)
- Contextual grammars with distributed catenation and shuffle (Q5055941) (← links)
- An Overview of 2D Picture Array Generating Models Based on Membrane Computing (Q5112179) (← links)
- Generative Capacity of Contextual Grammars with Subregular Selection Languages* (Q5164871) (← links)
- On Contextual Grammars with Subregular Selection Languages (Q5200087) (← links)
- k-Local Internal Contextual Grammars (Q5200090) (← links)
- (Q5867515) (← links)
