Decision Trees for Regular Language Word Recognition

Authors:
Mikhail Moshkov
Affiliations:
(Correspd.) Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia. e-mail: moshkov@nnucnit.unn.ac.ru
Venue:
Fundamenta Informaticae
Year:
2000

Citing 3
Cited 0

Unimprovable upper bounds on time complexity of decision trees

Fundamenta Informaticae
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
On Recognition of Words from Languages Generated by Linear Grammars with One Nonterminal Symbol

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.