[Full text]

Automata and formal languages, logic in computer science, compu- tational complexity, infinite words, ω -languages, 1-counter automaton, 2-tape automaton, cardinality problems,

17 The following information is presented in the table: the number of rules (1), the number of rules analyzed during the inference (2) 18 , the time of the inference process for

Accordingly, the aim of this study was to investigate the uses and effects of music-videos during exercise and to propose a theory grounded in data that will underpin the application

To study the hypothesis that with a decrease of the sample size, the accuracy of the classification of fuzzy decision trees is better than classifying with classical ones, the

For instance, if one node has a very high energy consumption value, all of its children will compute their path according to energy consumption regardless of any other metric, even

For an explanation of this notation see our paper 'Some Problems of Diophantine Ap- proximation (II)', Acta Mathematica, vol.. BOHR and I,ANDAU, GOttinger

The set-theoretic decision problem calls for the existence of an algorithm that, given a purely universal formula in mem- bership and equality, establishes whether there exist sets

Keywords : Data Representativeness, Fuzzy Set Theory, Robustness, Data Analysis, Clustering, Multidimensional data, Multivariate Analysis, Ordinal Analysis, Rank Transformation..