- Record: found
- Abstract: not found
- Book Chapter: not found
Machines, Computations, and Universality
On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references3
- Record: found
- Abstract: not found
- Book: not found
Regulated Rewriting in Formal Language Theory
Jürgen Dassow, Gheorghe Păun (1989)
- Record: found
- Abstract: not found
- Article: not found
Six nonterminals are enough for generating each r.e. language by a matrix grammar
Gheorghe P[acaron]un (1984)