Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/ios-press/on-a-construction-of-context-free-grammars-ukvWWSgO0S
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- IOS Press
- Copyright
- Copyright © 2000 by IOS Press, Inc
- ISSN
- 0169-2968
- eISSN
- 1875-8681
- Publisher site
- See Article on Publisher Site
Abstract
The grammatical inference problem is solved for the class of context-free languages. A context-free language is supposed to be given by means of all its strings. Considering all strings of length bounded by k, context-free grammars Gj,k with 1 ≤ j < k are constructed. A continual increasing of the index k leads to an infinite sequence (Gj,k)j<k. It is proved that Gj,k are equivalent for all j ≤ jo, k ≥ ko with some positive integers jo, ko. Moreover, the equivalences among these grammars can be recognized on the basis of involved nonterminals and productions only.
Journal
Fundamenta Informaticae – IOS Press
Published: Jan 1, 2000