Correction to: “On star height hierarchies of context-free languages”
Correctness of horizontal and vertical composition for implementation concepts based on constructors and abstractors.
A new implementation concept for parameterized specifications based on constructors and abstractors was recently introduced by Orejas, Navarro and Sánchez which includes most of the implementation concepts in the literature for initial as well as loose semantics. In this paper we redefine vertical and different kinds of horizontal compositions using the new concept of semi-pushout defined for a mixture of signature and specification morphisms. The main results concerning correctness of horizontal...
Correlation-based feature selection strategy in classification problems
In classification problems, the issue of high dimensionality, of data is often considered important. To lower data dimensionality, feature selection methods are often employed. To select a set of features that will span a representation space that is as good as possible for the classification task, one must take into consideration possible interdependencies between the features. As a trade-off between the complexity of the selection process and the quality of the selected feature set, a pairwise...
Corrigendum
Corrigendum : “Complexity of infinite words associated with beta-expansions”
We add a sufficient condition for validity of Propo- sition 4.10 in the paper Frougny et al. (2004). This condition is not a necessary one, it is nevertheless convenient, since anyway most of the statements in the paper Frougny et al. (2004) use it.
Corrigendum: Complexity of infinite words associated with beta-expansions
We add a sufficient condition for validity of Propo- sition 4.10 in the paper Frougny et al. (2004). This condition is not a necessary one, it is nevertheless convenient, since anyway most of the statements in the paper Frougny et al. (2004) use it.
Corrigendum: On multiperiodic words
An algorithm is corrected here that was presented as Theorem 2 in [Š. Holub, RAIRO-Theor. Inf. Appl. 40 (2006) 583–591]. It is designed to calculate the maximum length of a nontrivial word with a given set of periods.
Corrigendum: On multiperiodic words
An algorithm is corrected here that was presented as Theorem 2 in [Š. Holub, RAIRO-Theor. Inf. Appl. 40 (2006) 583–591]. It is designed to calculate the maximum length of a nontrivial word with a given set of periods.
Corrigendum to our paper: How Expressions Can Code for Automata
In a previous paper, we have described the construction of an automaton from a rational expression which has the property that the automaton built from an expression which is itself computed from a co-deterministic automaton by the state elimination method is co-deterministic. It turned out that the definition on which the construction is based was inappropriate, and thus the proof of the property was flawed. We give here the correct definition of the broken derived terms of an...
Corrigendum to “Realizations of Loops and Groups defined by short identities”
Coset enumeration of groups generated by symmetric sets of involutions.
Cost analysis of a queueing system with two service facilities
Cost-efficient synthesis of multiprocessor heterogeneous systems
Could a combinatorial optimization problem be solved by a differential equation?
El Problema del Viajante puede plantearse a partir del modelo de red neuronal continuo de Hopfield, que determina una solución de equilibrio para una ecuación diferencial con parámetros desconocidos. En el artículo se detalla el procedimiento de determinación de dichos parámetros con el fin de asegurar que la solución de la ecuación diferencial proporcione soluciones válidas para el Problema del Viajante.
Countable nondeterminism and logics of programs: fair-wellfoundedness of while-programs with nondeterministic assignments in the logic ALNA
Counterexamples in optimal quadrature.
Counting abelian squares.
Counting bordered partial words by critical positions.
Counting equivalence classes of irreducible representations.
Counting Facets and Incidences.