This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.
This paper is a survey of results on finite variable logics in finite model theory. It focusses on the common underlying techniques that unite many such results.
The paper deals with the decomposition and with the boundarz and hull construction of the so-called nondense point set. This problem and its applications have been frequently studied in computational geometry, raster graphics and, in particular, in the image processing (see e.g. [3], [6], [7], [8], [9], [10]). We solve a problem of the point set decomposition by means of certain relations in graph theory.
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest number r for which there exists an infinite r+-free word containing a finite number of r-powers. We show that there exists an infinite Dejean word on a 4-letter alphabet (i.e. a word without factors of exponent more than 7/5 ) containing only two 7/5 -powers. For a 5-letter alphabet, we show that there exists an infinite Dejean word containing only 60 5/4 -powers, and we conjecture that this number...
Motivated by applications in queueing fluid models and ruin theory, we analyze the asymptotics of , where , i = 1,...,n, are independent fractional Brownian motions with Hurst parameters and λ₁,...,λₙ > 0. The asymptotics takes one of three different qualitative forms, depending on the value of .
We define finite type invariants for cyclic equivalence classes of nanophrases and construct universal invariants. Also, we identify the universal finite type invariant of degree 1 essentially with the linking matrix. It is known that extended Arnold basic invariants to signed words are finite type invariants of degree 2, by Fujiwara's work. We give another proof of this result and show that those invariants do not provide the universal one of degree 2.
In this paper, we describe an efficient method for 3D image segmentation. The method uses a PDE model – the so called generalized subjective surface equation which is an equation of advection-diffusion type. The main goal is to develop an efficient and stable numerical method for solving this problem. The numerical solution is based on semi-implicit time discretization and flux-based level set finite volume space discretization. The space discretization is discussed in details and we introduce three...
About two years ago, Gobbino [21] gave a proof of a De Giorgi's conjecture on the approximation of the Mumford-Shah energy by means of finite-differences based non-local functionals. In this work, we introduce a discretized version of De Giorgi's approximation, that may be seen as a generalization of Blake and Zisserman's “weak membrane” energy (first introduced in the image segmentation framework). A simple adaptation of Gobbino's results allows us to compute the Γ-limit of this discrete functional...
In this paper we deal with a problem of segmentation (including missing boundary completion) and subjective contour creation. For the corresponding models we apply the semi-implicit finite volume numerical schemes leading to methods which are robust, efficient and stable without any restriction to a time step. The finite volume discretization enables to use the spatial adaptivity and thus improve significantly the computational time. The computational results related to image segmentation with partly...
The ORBEX coprocessor has been designed to execute the typical fuzzy operations of a system based on fuzzy rules. The first real application has been fuzzy controllers for electric cars. The values of the input variables, the position and the orientation of the car with respect the desired trajectory of reference, are obtained from the data provided by a DGPS boarded in the vehicle. The values of the output variables provided by the controller are the angle that the steering wheel has to be turned...
Third of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a consequence, the evaluation of any w.f.f. string and the relation of logical implication are introduced....
The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.
The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.