Decision trees for regular language word recognition

• Autorzy: Moshkov M.
• Języki publikacji: EN

Abstrakty

EN

In this paper the problem of recognition of words with fixed length from a regular language is considered. The word under consideration can be interpreted as a description of certain screen image in the following way: the i-th letter of the word encodes the color of the i-th screen cell. In this case a decision tree which recognizes some words may be interpreted as an algorithm for the recognition of images which are defined by considered words. The classification of all regular languages depending on the growth of minimal depth of decision trees for language word recognition with the growth of the word length is obtained. In proofs methods of test theory and rough set theory are used.

Słowa kluczowe

EN

decision tree; regular language; rough sets

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2000
• Tom: Vol. 41, Nr 4
• Strony: 449--461
• Opis fizyczny: bibliogr. 15 poz.

Twórcy

autor

Moshkov M.

• Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia,