3,175 research outputs found
A Bibliography on Fuzzy Automata, Grammars and Lanuages
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics and natural language processing
A coalgebraic approach to fuzzy automata
In this thesis, we make a coalgebraic description of fuzzy automata allowing their integration in much general context. Thus, results obtained indivudually to fuzzy automata end up to be consequence of their coalgebraic description. In particular, a coalgebraic definition of the fuzzy language recognized by a fuzzy automaton is obtained. And, by defining a monad for fuzzy sets, a functor that describes a determinization process via a generalization of the powerset construction is obtained
Linear Time Logics - A Coalgebraic Perspective
We describe a general approach to deriving linear time logics for a wide
variety of state-based, quantitative systems, by modelling the latter as
coalgebras whose type incorporates both branching behaviour and linear
behaviour. Concretely, we define logics whose syntax is determined by the
choice of linear behaviour and whose domain of truth values is determined by
the choice of branching, and we provide two equivalent semantics for them: a
step-wise semantics amenable to automata-based verification, and a path-based
semantics akin to those of standard linear time logics. We also provide a
semantic characterisation of the associated notion of logical equivalence, and
relate it to previously-defined maximal trace semantics for such systems.
Instances of our logics support reasoning about the possibility, likelihood or
minimal cost of exhibiting a given linear time property. We conclude with a
generalisation of the logics, dual in spirit to logics with discounting, which
increases their practical appeal in the context of resource-aware computation
by incorporating a notion of offsetting.Comment: Major revision of previous version: Sections 4 and 5 generalise the
results in the previous version, with new proofs; Section 6 contains new
result
Cinnamons: A Computation Model Underlying Control Network Programming
We give the easily recognizable name "cinnamon" and "cinnamon programming" to
a new computation model intended to form a theoretical foundation for Control
Network Programming (CNP). CNP has established itself as a programming paradigm
combining declarative and imperative features, built-in search engine, powerful
tools for search control that allow easy, intuitive, visual development of
heuristic, nondeterministic, and randomized solutions. We define rigorously the
syntax and semantics of the new model of computation, at the same time trying
to keep clear the intuition behind and to include enough examples. The
purposely simplified theoretical model is then compared to both WHILE-programs
(thus demonstrating its Turing-completeness), and the "real" CNP. Finally,
future research possibilities are mentioned that would eventually extend the
cinnamon programming into the directions of nondeterminism, randomness, and
fuzziness.Comment: 7th Intl Conf. on Computer Science, Engineering & Applications
(ICCSEA 2017) September 23~24, 2017, Copenhagen, Denmar
- …