Limits of pure grammars with monotone productions

• Autorzy: Martinek P.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

grammatical inference problem; pure (or special) grammar; limits of pure grammars; language generated by pure grammars; monotone productions

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 1998
• Tom: Vol. 33, nr 3
• Strony: 265--280
• Opis fizyczny: bibliogr. 8 poz.

Twórcy

autor

Martinek P.

• Faculty of Forestry and Wood Technology, Mendel University of Agriculture and Forestry, Zemědělska 3, 613 00 Brno, Czech Republic