Related papers: Brzozowski type determinization for fuzzy automata
In this paper we propose a novel approach for learning from data using rule based fuzzy inference systems where the model parameters are estimated using Bayesian inference and Markov Chain Monte Carlo (MCMC) techniques. We show the…
We generalize the notion of complete binary relation on complete lattice to residuated lattice valued ordered sets and show its properties. Then we focus on complete fuzzy tolerances on fuzzy complete lattices and prove they are in…
We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same…
Today manufacturers are using fuzzy logic in everything from cameras to industrial process control. Fuzzy logic controllers are easier to design and so are cheaper to produce. Fuzzy logic captures the impreciseness inherent in most input…
Colcombet and Petri\c{s}an argued that automata may be usefully considered from a functorial perspective, introducing a general notion of "V-automaton" based on functors into V. This enables them to recover different standard notions of…
The current article discusses some applications of fuzzy logic to assessment of learning. We consider here a new trapezoidal fuzzy model for learning assessment.
We present the efficient implementations of probabilistic deterministic finite automaton learning methods available in FlexFringe. These implement well-known strategies for state-merging including several modifications to improve their…
Weighted automata is a basic tool for specification in quantitative verification, which allows to express quantitative features of analysed systems such as resource consumption. Quantitative specification can be assisted by automata…
Controlling hybrid systems is mostly very challenging due to the variety of dynamics these systems can exhibit. Inspired by the concept of differential flatness of nonlinear continuous systems and their inherent invertibility property, the…
We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the…
A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…
Fuzzy Transform (F-transform) has been introduced as an approximation method which encompasses both classical transforms and approximation methods studied in fuzzy modeling and fuzzy control. It has been proved that, under some conditions,…
Fuzzy cellular automaton is a dynamical system with a continuous state value embedding a cellular automaton with a discrete state value. We investigate a fuzzy cellular automaton obtained from an elementary cellular automaton of rule number…
These pages review two families of mimetic finite difference methods: the mixed-type methods presented in [Brezzi, Lipnikov, and Simoncini, M3AS, 2005] and the nodal methods of [Brezzi, Buffa, and Lipnikov, M2AN, 2009]. The purpose of this…
Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are…
History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some…
We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for…
This paper proposes two kinds of fuzzy abductive inference in the framework of fuzzy rule base. The abductive inference processes described here depend on the semantic of the rule. We distinguish two classes of interpretation of a fuzzy…
Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…