with the explosive growth in amount of information, it is highly required to utilize tools and methods in order to search, filter and manage resources. one of the major problems in text classification relates to the high dimensional feature spaces. therefore, the main goal of text classification is to reduce the dimensionality of features space. there are many feature selection methods. however...

Geldenhuys and Hansen showed that a kind of ω-automata known as Testing Automata (TA) can, in the case of stuttering-insensitive properties, outperform the Büchi automata traditionally used in the automata-theoretic approach to model checking [10]. In previous work [23], we compared TA against Transition-based Generalized Büchi Automata (TGBA), and concluded that TA were more interesting when c...

The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry (1986). The pioneering work of these authors was the pursuit algorithm, which pursues only the current estimated optimal action. If this action is not the one with the minimum penalty probability, this algorithm pursues a wrong action. In this paper, w...

We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the hB; ricrossing-bounded approximation), and derive automata-theoretic characterizations of the binary re...

We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the -reset-bounded approximation, the -bounded approximation, and the crossing-bounded approximation), and derive automata-theoretic characterizations of the binary reachabili...

We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the -reset-bounded approximation, the -bounded approximation, and the crossing-bounded approximation), and derive automata-theoretic characterizations of the binary reachabili...