Pages that link to "Item:Q3991298"

The following pages link to Normal forms for phrase-structure grammars (Q3991298):

Displaying 33 items.

• Networks of evolutionary processors: computationally complete normal forms (Q256426) (← links)
• One-sided random context grammars with a limited number of right random context rules (Q385971) (← links)
• Matrix insertion-deletion systems (Q714867) (← links)
• Parsimonious computational completeness (Q832917) (← links)
• Iterated sequential transducers as language generating devices (Q861252) (← links)
• Descriptional complexity of multi-parallel grammars (Q975402) (← links)
• A note on the descriptional complexity of semi-conditional grammars (Q990095) (← links)
• Cancellation in context-free languages: enrichment by reduction (Q1325840) (← links)
• DNA computing based on splicing: Universality results (Q1575909) (← links)
• On path-controlled insertion-deletion systems (Q1713412) (← links)
• Hybrid networks of evolutionary processors are computationally complete (Q1772104) (← links)
• On the computing powers of \(\mathcal{L}\)-reductions of insertion languages (Q1998879) (← links)
• Universal insertion grammars of size two (Q2004002) (← links)
• Generalized forbidding matrix grammars and their membrane computing perspective (Q2055827) (← links)
• Languages of distributed reaction systems (Q2104134) (← links)
• On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
• \(\mathcal{L}\)-reduction computation revisited (Q2170281) (← links)
• On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685) (← links)
• Computational completeness of path-structured graph-controlled insertion-deletion systems (Q2399250) (← links)
• Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
• CD GRAMMAR SYSTEMS WITH REGULAR START CONDITIONS (Q3526534) (← links)
• (Q4988157) (← links)
• Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
• Deterministic Lindenmayer Systems with Dynamic Control of Parallelism (Q5217113) (← links)
• (Q5867515) (← links)
• Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)
• Formal properties of PA-matching (Q5958115) (← links)
• Operations and language generating devices suggested by the genome evolution (Q5958327) (← links)
• Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← links)
• Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) (Q6150989) (← links)
• When Stars Control a Grammar's Work (Q6204128) (← links)
• Networks of Watson-Crick D0L systems with communication by substrings (Q6204551) (← links)
• On the computational completeness of generalized forbidding matrix grammars (Q6496878) (← links)