-regular languages defined by a limit operator.
1.0957-Approximation Algorithm for Random MAX-3SAT
We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.
2-layer straightline crossing minimization: Performance of exact and heuristic algorithms.
minus the .
4D Embryogenesis image analysis using PDE methods of image processing
In this paper, we introduce a set of methods for processing and analyzing long time series of 3D images representing embryo evolution. The images are obtained by in vivo scanning using a confocal microscope where one of the channels represents the cell nuclei and the other one the cell membranes. Our image processing chain consists of three steps: image filtering, object counting (center detection) and segmentation. The corresponding methods are based on numerical solution of nonlinear PDEs, namely...
5-abelian cubes are avoidable on binary alphabets
A k-abelian cube is a word uvw, where the factors u, v, and w are either pairwise equal, or have the same multiplicities for every one of their factors of length at most k. Previously it has been shown that k-abelian cubes are avoidable over a binary alphabet for k ≥ 8. Here it is proved that this holds for k ≥ 5.
-пространства.
9th Asian Logic Conference, Novosibirsk, Russia, 16--19 August 2005.
Łukasiewicz language and diagonals of formal series. (Langage de Łukasiewicz et diagonales de séries formelles.)
'Matrioshka's' soft approaches to personalized web exploration
(Pure) logic out of probability.
Today, Logic and Probability are mostly seen as independent fields with a separate history and set of foundations. Against this dominating perception, only a very few people (Laplace, Boole, Peirce) have suspected there was some affinity or relation between them. The truth is they have a considerable common ground which underlies the historical foundation of both disciplines and, in this century, has prompted notable thinkers as Reichenbach [14], Carnap [2] [3] or Popper [12] [13] (and Gaifman [5],...
*-sturmian words and complexity
We give analogs of the complexity and of Sturmian words which are called respectively the -complexity and -Sturmian words. We show that the class of -Sturmian words coincides with the class of words satisfying , and we determine the structure of -Sturmian words. For a class of words satisfying , we give a general formula and an upper bound for . Using this general formula, we give explicit formulae for for some words belonging to this class. In general, can take large values, namely,...
-shift, systèmes de numération et automates
In this note we prove that the language of a numeration system is the language of a -shift under some assumptions on the basis. We deduce from this result a partial answer to the question when the language of a numeration system is regular. Moreover, we give a characterization of the arithmetico-geometric sequences and the mixed radix sequences that are basis of a numeration system for which the language is regular. Finally, we study the Ostrowski systems of numeration and give another proof of...
-энтропия компактов в и табулирование непрерывных функций.
-bicomplete categories and parity games
For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by -terms. We call the category -bicomplete if every -term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...
μ-Bicomplete Categories and Parity Games
For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by μ-terms. We call the category μ-bicomplete if every μ-term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...
А. А. Ляпунов и кибернетика
Агрегатная декомпозиция автоматов и управление агрегатами
Алгебраическое исследование простейших кодов и бсекоэффициентных уравнений в словах
Алгольные процедуры для решения некоторых задач алгебры, основанные на применении нормализованного процесса