scientific article; zbMATH DE number 4064526
From MaRDI portal
Publication:3798273
Recommendations
Cited in
(28)- On the descriptional complexity of scattered context grammars
- On a kind of Fatou property of context-free groups
- On characterizations of recursively enumerable languages
- On three variants of rewriting P systems
- Power and size of extended Watson-Crick L systems.
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
- Dynamically controlled cooperating/distributed grammar systems
- Homogeneous grammars with a reduced number of non-context-free products
- PC grammar systems with five context-free components generate all recursively enumerable languages.
- Descriptional complexity of semi-conditional grammars
- CD grammar systems: competence and confidence
- On the nonterminal complexity of tree controlled grammars
- Normal forms for multiple context-free languages and displacement Lambek grammars
- Direction independent context-sensitive grammars
- scientific article; zbMATH DE number 4064512 (Why is no real title available?)
- scientific article; zbMATH DE number 21368 (Why is no real title available?)
- Normal forms for phrase-structure grammars
- Scattered context grammars generate any recursively enumerable language with two nonterminals
- scientific article; zbMATH DE number 1354905 (Why is no real title available?)
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Emergence in context-free parallel communicating grammar systems: what does and does not make a grammar system more expressive than its parts
- General CD grammar systems and their simplification
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model
- ON ALTERNATING PHRASE-STRUCTURE GRAMMARS
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Scattered context grammars with one non-context-free production and six nonterminals are computationally complete
- Left-forbidding cooperating distributed grammar systems
- Nonterminal complexity of tree controlled grammars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798273)
