On the inference of non-confluent NLC graph grammars | UPT Perpustakaan UHAMKA