Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: pure (or special) grammar

Sortuj według:

Ogranicz wyniki do:

Limits of pure grammars with monotone productions

Martinek P.

Fundamenta Informaticae

1998

Vol. 33, nr 3

265-280

The grammatical inference problem is solved for a class of languages which can be generated by pure grammars with non-shortening productions. Necessary and sufficient condition for determination whether a language belongs to this class is formulated and proved. Finally, an algorithm for assigning a pure grammar to any language from the class is described.