1,721,257 research outputs found

    Missing factors of ideals and synchronizing automata

    No full text
    Recently, a series of papers have started to look at Cerný‘s conjecture, and in general at synchronizing automata, from the point of view of the theory of ideals of free monoids. The starting point of such an approach is a simple observation: the set of reset words of an automaton is a two-sided ideal of the free monoid on its alphabet that is also a regular language. We study the relationship between a synchronizing automaton and the sets of (minimal) generators of its reset words. We show that if such set does not contain a word of a certain length, then Cerný‘s conjecture holds

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    Time Modalities over Many-valued Logics

    No full text
    Model checking has been traditionally concerned on verifying a (critical) system against its specification, which is generally expressed in temporal logic. Despite this verification technique is mature, it becomes useless when the specification incorporates vagueness, especially for the temporal constraints. This is often the case when non-critical adaptive systems are considered. These systems may tolerate small violations or may need to be aware of the satisfaction degree of their specification for re-configuration purposes. We present FTL (Fuzzy-time Temporal Logic), an extension of LTL that relaxes the notion of time, and propose a verification technique to evaluate the truth degree of such vague temporal properties. Our verification technique has been implemented in a prototype and the experimental results are promising
    corecore