A general approach to inference of context-free programmed grammars
From MaRDI portal
Publication:3219141
DOI10.1109/TSMC.1984.6313202zbMath0555.68054MaRDI QIDQ3219141
Publication date: 1984
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
syntactic pattern recognitioncontext-free programmed grammarsinferability analysisstring pattern description
Related Items (2)
Inferability of context-free programmed grammars ⋮ Modeling production rules by means of predicate transition networks
This page was built for publication: A general approach to inference of context-free programmed grammars