Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: identification in the limit

Sortuj według:

Ogranicz wyniki do:

On a construction of context-free gramma

Martinek P.

Fundamenta Informaticae

2000

Vol. 44, Nr 3

245-264

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 G(j,k) with 1 < j < k are constructed. A continual increasing of the index k leads to an infinite sequence. It is proved that G(j,k) are equivalent for all j > j(o), k > k(o) with some positive integers j(o), k(o). Moreover, the equivalences among these grammars can be recognized on the basis of involved nonterminals and productions only.