On the generative power of regular pattern grammars
From MaRDI portal
Recommendations
Cited in
(21)- Scattered context grammars with one non-context-free production are computationally complete
- Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages
- Prefix pushdown automata and their simplification
- Syntactic complexity of scattered context grammars
- A pumping result for 2-context-free languages
- Simultaneously One-Turn Two-Pushdown Automata
- Generative power of three-nonterminal scattered context grammars
- Middle quotients of linear languages
- Applications of scheduling theory to formal language theory
- Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
- A combinatorial property of EOL languages
- Table systems with unconditional transfer
- Manipulating derivation forests by scheduling techniques
- Regular and context-free pattern languages over small alphabets
- Hierarchy ofk-context-free languages
- Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
- Canonical scattered context generators of sentences with their parses
- One-sided forbidding grammars and selective substitution grammars
- Hierarchy of k-context-free languages part 1
- Self-reproducing pushdown transducers
- Regular patterns, regular languages and context-free languages
This page was built for publication: On the generative power of regular pattern grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794441)
