Context-free grammars with regular conditions
Context-free languages with rational index in for algebraic numbers
Contextual grammars vs. context-free algebras
Convergence behavior of the (1 +, λ) evolution strategy on the ridge functions.
The convergence behavior of (1 +, λ)-ES is investigated at parabolic ridge, sharp ridge, and at the general case of the ridge functions. The progress rate, the distance to the ridge axis, the success rate, and the success probability are used in the analysis. The strong dependency of the (1 + λ)-ES to the initial conditions is shown using parabolic ridge test function when low distances to the ridge axis are chosen as the start value. The progress rate curve and the success probability curve of...
Convergence of a branching type recursion
Conversion of regular expressions into realtime automata
We consider conversions of regular expressions into k-realtime finite state automata, i.e., automata in which the number of consecutive uses of ε-transitions, along any computation path, is bounded by a fixed constant k. For 2-realtime automata, i.e., for automata that cannot change the state, without reading an input symbol, more than two times in a row, we show that the conversion of a regular expression into such an automaton produces only O(n) states, O(nlogn) ε-transitions, and O(n) alphabet-transitions....
Convolutive decomposition and fast summation methods for discrete-velocity approximations of the Boltzmann equation
Discrete-velocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically O(N2d + 1) where d is the dimension of the velocity space. In this paper, following the ideas introduced in [C. Mouhot and L. Pareschi, C. R. Acad. Sci. Paris Sér. I Math. 339 (2004) 71–76, C. Mouhot and L. Pareschi, Math. Comput. 75 (2006) 1833–1852], we derive fast summation techniques for the evaluation of...
Conway's Games and Some of their Basic Properties
We formulate a few basic concepts of J. H. Conway's theory of games based on his book [6]. This is a first step towards formalizing Conway's theory of numbers into Mizar, which is an approach to proving the existence of a FIELD (i.e., a proper class that satisfies the axioms of a real-closed field) that includes the reals and ordinals, thus providing a uniform, independent and simple approach to these two constructions that does not go via the rational numbers and hence does for example not need...
Coordinated pair systems ; part I : Dyck works and classical pumping
Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma
Coproducts of ideal monads
The question of how to combine monads arises naturally in many areas with much recent interest focusing on the coproduct of two monads. In general, the coproduct of arbitrary monads does not always exist. Although a rather general construction was given by Kelly [Bull. Austral. Math. Soc. 22 (1980) 1–83], its generality is reflected in its complexity which limits the applicability of this construction. Following our own research [C. Lüth and N. Ghani, Lect. Notes Artif. Intell. 2309 (2002) 18–32],...
Coproducts of Ideal Monads
The question of how to combine monads arises naturally in many areas with much recent interest focusing on the coproduct of two monads. In general, the coproduct of arbitrary monads does not always exist. Although a rather general construction was given by Kelly [Bull. Austral. Math. Soc.22 (1980) 1–83], its generality is reflected in its complexity which limits the applicability of this construction. Following our own research [C. Lüth and N. Ghani, Lect. Notes Artif. Intell.2309 (2002)...
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...
Corrigendum
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...
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 bordered partial words by critical positions.