Nonterminal complexity of programmed grammars.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1738663
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- scientific article; zbMATH DE number 1738664
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- On the nonterminal complexity of tree controlled grammars
Cites work
- scientific article; zbMATH DE number 4068327 (Why is no real title available?)
- scientific article; zbMATH DE number 1738655 (Why is no real title available?)
- scientific article; zbMATH DE number 1738663 (Why is no real title available?)
- scientific article; zbMATH DE number 1738664 (Why is no real title available?)
- scientific article; zbMATH DE number 1870544 (Why is no real title available?)
- scientific article; zbMATH DE number 1400024 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A hierarchy between context-free and context-sensitive languages
- Accepting grammars with regulation
- Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages
- Generative power of three-nonterminal scattered context grammars
- Machines, computations, and universality. 3rd international conference, MCU 2001, Chişinǎu, Moldova, May 23--27, 2001. Proceedings
- On the leftmost derviation in matrix grammars
- Petri net algorithms in the theory of matrix grammars
- Programmed Grammars and Classes of Formal Languages
- Regulated grammars under leftmost derivation
- Remarks on blind and partially blind one-way multicounter machines
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- Syntactic complexity of scattered context grammars
- Unconditional transfer in regulated rewriting
Cited in
(25)- scientific article; zbMATH DE number 1738664 (Why is no real title available?)
- Six nonterminals are enough for generating each r.e. language by a matrix grammar
- On the number of nonterminals in linear conjunctive grammars
- On the computational completeness of matrix simple semi-conditional grammars
- Parsimonious computational completeness
- scientific article; zbMATH DE number 1738663 (Why is no real title available?)
- Programmed grammars and their relation to the LBA problem
- scientific article; zbMATH DE number 58320 (Why is no real title available?)
- Generative power of matrix insertion-deletion systems with context-free insertion or deletion
- Investigations on the power of matrix insertion-deletion systems with small sizes
- Generalized forbidding matrix grammars and their membrane computing perspective
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Nonterminal complexity of tree controlled grammars
- Nonterminal complexity of one-sided random context grammars
- scientific article; zbMATH DE number 6606360 (Why is no real title available?)
- Programmed grammars with rule queues
- Workspace theorems for regular-controlled grammars
- Improved descriptional complexity results on generalized forbidding grammars
- The power of programmed grammars with graphs from various classes
- On the computational completeness of generalized forbidding matrix grammars
- One-sided random context grammars with leftmost derivations
- scientific article; zbMATH DE number 4203730 (Why is no real title available?)
- scientific article; zbMATH DE number 4053048 (Why is no real title available?)
This page was built for publication: Nonterminal complexity of programmed grammars.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401269)
