Gheorghe Paun Regular Extended H Systems are Computationally Universal. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 1996, v:1, n:1, pp:27-36 [Journal]
Kai Salomaa On the Modularity of Decidability of Completeness and Termination. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 1996, v:1, n:1, pp:37-54 [Journal]
Dietmar Wätjen Regulations of Uniformly k-Limited ET0L Systems and Their Relations to Controlled Context-Free Grammars. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 1996, v:1, n:1, pp:55-80 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
