A finite word poset.
A finiteness property and an automatic structure for Coxeter groups.
A first approach to the multipurpose relational database server.
In this paper, an architecture and an implementation of a multipurpose relational database server are proposed. This architecture enables classical queries to be executed, deductions to be made, and data mining operations to be performed on fuzzy or classical data. The proposal of this integration is to combine several ways of querying different types of data. In order to achieve this, a combination of existing meta-knowledge bases and new data catalog elements is presented. We also introduce a...
A fluid model for a relay node in an ad hoc network: Evaluation of resource sharing policies.
A formal analysis of the computational dynamics in GIGANTEC.
An evolutionary algorithm formalism has been forwarded in a previous research, and implemented in the system GIGANTEC: Genetic Induction for General Analytical Non-numeric Task Evolution Compiler [Bad98][Bad99]. A dynamical model is developed to analyze the behaviour of the algorithm. The model is dependent in its analysis on classical Compilers Theory, Game Theory and Markov Chains and its convergence characteristics. The results conclude that a limiting state is reached, which is independent of...
A Formal, Object-Oriented Approach to the Machine Interference Model
A formalism for treating equivalence of recursive procedures
A framework for the static and interactive visualization of statecharts.
A full-fledged model of machine translation
A fully equational proof of Parikh’s theorem
We show that the validity of Parikh’s theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of -term equations of continuous commutative idempotent semirings.
A Fully Equational Proof of Parikh's Theorem
We show that the validity of Parikh's theorem for context-free languages depends only on a few equational properties of least pre-fixed points. Moreover, we exhibit an infinite basis of μ-term equations of continuous commutative idempotent semirings.
A functional analysis model for natural images permitting structured compression
a functional analysis model for natural images permitting structured compression
This paper describes a compact perceptual image model intended for morphological representation of the visual information contained in natural images. We explain why the total variation can be a criterion to split the information between the two main visual structures, which are the sketch and the microtextures. We deduce a morphological decomposition scheme, based on a segmentation where the borders of the regions correspond to the location of the topological singularities of a topographic map. This...
A functional central limit theorem for a class of interacting Markov chain Monte Carlo methods.
A Fuzzy Approach to Evoluation and Management of Therapeutic Procedure in Diabetes Mellitus Treatment
A fuzzy computational model implementation
A fuzzy shape database to support conceptual design
A fuzzy system with ε-insensitive learning of premises and consequences of if-then rules
First, a fuzzy system based on ifFirst, a fuzzy system based on if-then rules and with parametric consequences is recalled. Then, it is shown that the globalthen rules and with parametric consequences is recalled. Then, it is shown that the global and local ε-insensitive learning of the above fuzzy system may be presented as a combination of both an ε-insensitive gradient method and solving a system of linear inequalities. Examples are given of using the introduced method to design fuzzy models...
A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II
The algebraic counterpart of the Wagner hierarchy consists of a well-founded and decidable classification of finite pointed ω-semigroups of width 2 and height ωω. This paper completes the description of this algebraic hierarchy. We first give a purely algebraic decidability procedure of this partial ordering by introducing a graph representation of finite pointed ω-semigroups allowing to compute their precise Wagner degrees. The Wagner degree of any ω-rational language can therefore be computed...
A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I
The algebraic study of formal languages shows that ω-rational sets correspond precisely to the ω-languages recognizable by finite ω-semigroups. Within this framework, we provide a construction of the algebraic counterpart of the Wagner hierarchy. We adopt a hierarchical game approach, by translating the Wadge theory from the ω-rational language to the ω-semigroup context. More precisely, we first show that the Wagner degree is indeed a syntactic invariant. We then define a reduction relation on...