Creator |
|
Language |
|
Publisher |
|
|
Date |
|
Source Title |
|
Vol |
|
Issue |
|
First Page |
|
Last Page |
|
Publication Type |
|
Access Rights |
|
Crossref DOI |
|
Related DOI |
|
|
Related URI |
|
|
Relation |
|
|
Abstract |
Our purpose in this paper is to construct a practical algorithm to inductively infer context-free languages. A basic procedure is first introduced to take out the self-embedding structure from given s...trings. Secondly, based on this procedure an algorithm to infer linear grammars from given finite sample sets is presented and its completeness is proved. Finally, by using a method to compose linear grammars, we propose an algorithm which is also complete for context-free languages.show more
|