Finitary codes for biinfinite words
Finite alogorithmic procedures and computation theories.
Finite alogorithmic procedures and inductive definability.
Finite and infinite computations of logic programs
Finite automata and algebraic extensions of function fields
We give an automata-theoretic description of the algebraic closure of the rational function field over a finite field , generalizing a result of Christol. The description occurs within the Hahn-Mal’cev-Neumann field of “generalized power series” over . In passing, we obtain a characterization of well-ordered sets of rational numbers whose base expansions are generated by a finite automaton, and exhibit some techniques for computing in the algebraic closure; these include an adaptation to positive...
Finite automata and arithmetic.
Finite automata with generalized acceptance criteria.
Finite branching automata
Finite categories and regular languages
Finite completion of comma-free codes. Part 1
This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...
Finite Completion of comma-free codes Part 1
This paper is the first step in the solution of the problem of finite completion of comma-free codes. We show that every finite comma-free code is included in a finite comma-free code of particular kind, which we called, for lack of a better term, canonical comma-free code. Certainly, finite maximal comma-free codes are always canonical. The final step of the solution which consists in proving further that every canonical comma-free code is completed to a finite maximal comma-free code, is intended...
Finite completion of comma-free codes. Part 2
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.
Finite Completion of comma-free codes Part 2
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.
Finite degrees of ambiguity in pattern languages
Finite models and finitely many variables
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.
Finite nondense point set analysis
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.
Finite repetition threshold for large alphabets
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...
Finite time asymptotics of fluid and ruin models: multiplexed fractional Brownian motions case
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 .
Finite type invariants for cyclic equivalence classes of nanophrases
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.
Finite volume schemes for the generalized subjective surface equation in image segmentation
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...