publicationentry of dblp and 1 other user:
(0)
This publication has not been reviewed yet.
rating distribution
average user rating
?
The average rating is computed over all reviews. However, some of them may be invisible to you due to the visibility setting chosen by the reviewers.
The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars.
by:In: Computational Intelligence, Vol. 10
(1994)
, p. 440-452.
Resources (URL, PDF, PS...)