1,055 research outputs found
Topological Complexity of omega-Powers : Extended Abstract
This is an extended abstract presenting new results on the topological
complexity of omega-powers (which are included in a paper "Classical and
effective descriptive complexities of omega-powers" available from
arXiv:0708.4176) and reflecting also some open questions which were discussed
during the Dagstuhl seminar on "Topological and Game-Theoretic Aspects of
Infinite Computations" 29.06.08 - 04.07.08
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions
What is the common link, if there is any, between Church-Rosser systems,
prefix codes with bounded synchronization delay, and local Rees extensions? The
first obvious answer is that each of these notions relates to topics of
interest for WORDS: Church-Rosser systems are certain rewriting systems over
words, codes are given by sets of words which form a basis of a free submonoid
in the free monoid of all words (over a given alphabet) and local Rees
extensions provide structural insight into regular languages over words. So, it
seems to be a legitimate title for an extended abstract presented at the
conference WORDS 2017. However, this work is more ambitious, it outlines some
less obvious but much more interesting link between these topics. This link is
based on a structure theory of finite monoids with varieties of groups and the
concept of local divisors playing a prominent role. Parts of this work appeared
in a similar form in conference proceedings where proofs and further material
can be found.Comment: Extended abstract of an invited talk given at WORDS 201
Other Buds in Membrane Computing
It is well-known the huge Mario’s contribution to the development
of Membrane Computing. Many researchers may relate his name
to the theory of complexity classes in P systems, the research of frontiers
of the tractability or the application of Membrane Computing to
model real-life situations as the Quorum Sensing System in Vibrio fischeri
or the Bearded Vulture ecosystem. Beyond these research areas, in
the last years Mario has presented many new research lines which can
be considered as buds in the robust Membrane Computing tree. Many of
them were the origin of new research branches, but some others are still
waiting to be developed. This paper revisits some of these buds
Automatic Ordinals
We prove that the injectively omega-tree-automatic ordinals are the ordinals
smaller than . Then we show that the injectively
-automatic ordinals, where is an integer, are the ordinals
smaller than . This strengthens a recent result of Schlicht
and Stephan who considered in [Schlicht-Stephan11] the subclasses of finite
word -automatic ordinals. As a by-product we obtain that the
hierarchy of injectively -automatic structures, n>0, which was
considered in [Finkel-Todorcevic12], is strict.Comment: To appear in a Special Issue on New Worlds of Computation 2011 of the
International Journal of Unconventional Computing. arXiv admin note: text
overlap with arXiv:1111.150
Analysis of Petri Nets and Transition Systems
This paper describes a stand-alone, no-frills tool supporting the analysis of
(labelled) place/transition Petri nets and the synthesis of labelled transition
systems into Petri nets. It is implemented as a collection of independent,
dedicated algorithms which have been designed to operate modularly, portably,
extensibly, and efficiently.Comment: In Proceedings ICE 2015, arXiv:1508.0459
A map of dependencies among three-valued logics
International audienceThree-valued logics arise in several fields of computer science, both inspired by concrete problems (such as in the management of the null value in databases) and theoretical considerations. Several three-valued logics have been defined. They differ by their choice of basic connectives, hence also from a syntactic and proof-theoretic point of view. Different interpretations of the third truth value have also been suggested. They often carry an epistemic flavor. In this work, relationships between logical connectives on three-valued functions are explored. Existing theorems of functional completeness have laid bare some of these links, based on specific connectives. However we try to draw a map of such relationships between conjunctions, negations and implications that extend Boolean ones. It turns out that all reasonable connectives can be defined from a few of them and so all known three-valued logics appear as a fragment of only one logic. These results can be instrumental when choosing, for each application context, the appropriate fragment where the basic connectives make full sense, based on the appropriate meaning of the third truth-value
- …