Foundations for stepwise refinement of program specifications via cylindric algebra theory
Fountains, histograms, and -identitie.
Fourth-order partial differential equations for effective image denoising.
FPOL systems generating counting languages
Fractal geometry, Turing machines and divide-and-conquer recurrences
Fractal image coding by multi-scale selection based on block complexity.
Fractal representation of the attractive lamination of an automorphism of the free group
In this paper, we extend to automorphisms of free groups some results and constructions that classically hold for morphisms of the free monoid, i.e., the so-called substitutions. A geometric representation of the attractive lamination of a class of automorphisms of the free group (irreducible with irreducible powers (iwip) automorphisms) is given in the case where the dilation coefficient of the automorphism is a unit Pisot number. The shift map associated with the attractive symbolic lamination...
Fractals, dimension, and formal languages
Fractional regularization term for variational image registration.
Fraktály a objektově orientované programování
Free algebras and automata realizations in the language of categories
Free associative algebras, noncommutative Gröbner bases, and universal associative envelopes for nonassociative structures
First, we provide an introduction to the theory and algorithms for noncommutative Gröbner bases for ideals in free associative algebras. Second, we explain how to construct universal associative envelopes for nonassociative structures defined by multilinear operations. Third, we extend the work of Elgendy (2012) for nonassociative structures on the 2-dimensional simple associative triple system to the 4- and 6-dimensional systems.
Free Discontinuity problems with unbounded Data: the two dimensional case.
Free group languages : rational versus recognizable
We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...
Free group languages: Rational versus recognizable
We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...
Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages
Fourth of a series of articles laying down the bases for classical first order model theory. This paper supplies a toolkit of constructions to work with languages and interpretations, and results relating them. The free interpretation of a language, having as a universe the set of terms of the language itself, is defined.The quotient of an interpreteation with respect to an equivalence relation is built, and shown to remain an interpretation when the relation respects it. Both the concepts of quotient...
Free, iteratively closed categories of complete lattices
Free Term Algebras
We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler algebras...
Free-form surfaces for scattered data by neural networks.
Frequencies of factors in Arnoux-Rauzy sequences