Normal forms for phrase-structure grammars
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4139308 (Why is no real title available?)
- scientific article; zbMATH DE number 3988738 (Why is no real title available?)
- scientific article; zbMATH DE number 4043269 (Why is no real title available?)
- scientific article; zbMATH DE number 4064526 (Why is no real title available?)
- scientific article; zbMATH DE number 3772981 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A Grammatical Characterization of One-Way Nondeterministic Stack Languages
- A Note on Bracketed Grammars
- A representation of recursively enumerable languages by two homomorphisms and a quotient
- A variant of a recursively unsolvable problem
- How to Make Arbitrary Grammars Look Like Context-Free Grammars
Cited in
(51)- Networks of evolutionary processors: computationally complete normal forms
- On path-controlled insertion-deletion systems
- Languages of distributed reaction systems
- On the computational completeness of matrix simple semi-conditional grammars
- Parsimonious computational completeness
- scientific article; zbMATH DE number 4064526 (Why is no real title available?)
- Iterated sequential transducers as language generating devices
- scientific article; zbMATH DE number 30957 (Why is no real title available?)
- scientific article; zbMATH DE number 4189198 (Why is no real title available?)
- Computational completeness of path-structured graph-controlled insertion-deletion systems
- Matrix insertion-deletion systems
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
- Succinct star-controlled insertion-deletion systems using space separating normal forms
- A note on the descriptional complexity of semi-conditional grammars
- Investigations on the power of matrix insertion-deletion systems with small sizes
- Universal insertion grammars of size two
- DNA computing based on splicing: Universality results
- Generalized forbidding matrix grammars and their membrane computing perspective
- Conclusive tree-controlled grammars
- Counting simple rules in semi-conditional grammars is not simple
- Formal properties of PA-matching
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- Nonterminal complexity of one-sided random context grammars
- Hybrid networks of evolutionary processors are computationally complete
- A syntactical analysis of normalization
- Descriptional complexity of multi-parallel grammars
- CD GRAMMAR SYSTEMS WITH REGULAR START CONDITIONS
- scientific article; zbMATH DE number 4064512 (Why is no real title available?)
- Space separating special Geffert normal form for succinct representation of star-controlled insertion-deletion systems
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
- Cancellation in context-free languages: enrichment by reduction
- \(\mathcal{L}\)-reduction computation revisited
- When Stars Control a Grammar's Work
- Networks of Watson-Crick D0L systems with communication by substrings
- A Single Movement Normal Form for Minimalist Grammars
- Improved descriptional complexity results on generalized forbidding grammars
- Non-simple rule counting in semi-conditional grammars
- Matrix forbidding grammars
- On the computational completeness of generalized forbidding matrix grammars
- Language classes of extended distributed reaction systems
- Star-controlled insertion-deletion systems describing regular closure of linear languages
- scientific article; zbMATH DE number 7584595 (Why is no real title available?)
- Normal forms for context-free node-rewriting hypergraph grammars
- Operations and language generating devices suggested by the genome evolution
- Implementation and Application of Automata
- General CD grammar systems and their simplification
- One-sided random context grammars with a limited number of right random context rules
- Normal-order reduction grammars
- Deterministic Lindenmayer Systems with Dynamic Control of Parallelism
- Homogeneous grammars with a reduced number of non-context-free products
This page was built for publication: Normal forms for phrase-structure grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991298)
