No Detail Found!

On the complexity of computation of two quantities associated with the use of inference of linear context free grammars.

Author(s)
Shah Nawab Khan Mathematics Department, University of Sind, Jamshoro, Pakistan
Abstract
The complexity of computation of two parameters of interest is discussed. One of these parameters is the number N1 of strings of any given length m derivable from an inferred grammers1G. The other parameter is the number N2 of strings derivable from G in derivations having n steps, where n is given. Both are likely to arise from any free or extensive use of an Interactive Heuristic Program.
Publication Details
Page(s) 107-122
DOI DOI not available
Published Journal: Sindh University Research Journal, Volume: 18, Issue: 2, Year: 1986

Request the full text from PASTIC

0

Citations

0

Downloads

47

Views