Nonterminal Complexity of Programmed Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Nonterminal complexity of programmed grammars
Theoretical Computer Science
On the degree of scattered context-sensitivity
Theoretical Computer Science
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
Theoretical Computer Science - Descriptional complexity of formal systems
Automatic generation of computeranimation: using AI for movie animation
Automatic generation of computeranimation: using AI for movie animation
| Hi-index | 0.00 |