A graph structure over the category of sets and partial functions
A Hierarchy of Automatic ω-Words having a Decidable MSO Theory
We investigate automatic presentations of ω-words. Starting points of our study are the works of Rigo and Maes, Caucal, and Carton and Thomas concerning lexicographic presentation, MSO-interpretability in algebraic trees, and the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is in a certain sense canonical. We then generalize our techniques to a hierarchy of classes of ω-words enjoying the above...
A hierarchy of cyclic languages
A hierarchy that does not collapse : alternations in low level space
A hybrid evolutionary approach to intelligent system design.
The problem of developing a general methodology for system design has always been demanding. For this purpose, an evolutionary algorithm, adapted with design-specific representation data structures is devised. The representation modeling the system to be designed, is composed of three levels of abstraction: the first, is an 'abstract brain' layer - mainly a number of competing finite state machines, which in turn control the second level composed of fuzzy Petri nets; the third level constitutes...
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
A Kleene-Schützenberger theorem for Lindenmayerian rational power series
We define L rational and L recognizable power series, and establish a Kleene-Schützenberger theorem for Lindenmayerian power series by showing that a power series is L rational if and only if it is L recognizable.
A language for expressing fuzzy temporal rules.
This paper deals with the formal description of what we call Fuzzy Temporal Propositions: propositions with explicitly expressed information of a temporal type. The set of syntactic rules that make a grammar up for defining a language for this kind of propositions is presented. For some of the rules, examples that illustrate the expressive power of this type of knowledge representation are introduced. Semantic criteria and definitions are also introduced through examples in order to show how intuitive...
A Linear Algorithm for Construction of Optimal Digital Convex 2k-gons
A linear time algorithm for the computation of some distance functions between convex polygons
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
A linear-time algorithm to decide whether a binary word contains an overlap
A little more about morphic Sturmian words
Among Sturmian words, some of them are morphic, i.e. fixed point of a non-identical morphism on words. Berstel and Séébold (1993) have shown that if a characteristic Sturmian word is morphic, then it can be extended by the left with one or two letters in such a way that it remains morphic and Sturmian. Yasutomi (1997) has proved that these were the sole possible additions and that, if we cut the first letters of such a word, it didn't remain morphic. In this paper, we give an elementary and combinatorial...
A lower bound for reversible automata
A Lower Bound For Reversible Automata
A reversible automaton is a finite automaton in which each letter induces a partial one-to-one map from the set of states into itself. We solve the following problem proposed by Pin. Given an alphabet A, does there exist a sequence of languages Kn on A which can be accepted by a reversible automaton, and such that the number of states of the minimal automaton of Kn is in O(n), while the minimal number of states of a reversible automaton accepting Kn is in O(ρn) for some ρ > 1? We give...
A Markovian concurrency measure
A mathematical framework for learning and adaption: (generalized) random systems with complete connections.
The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.
A mode of decomposition of regular languages.
A model category for the homotopy theory of concurrency.
A modified standard embedding for linear complementarity problems
We propose a modified standard embedding for solving the linear complementarity problem (LCP). This embedding is a special one-parametric optimization problem . Under the conditions (A3) (the Mangasarian–Fromovitz Constraint Qualification is satisfied for the feasible set depending on the parameter ), (A4) ( is Jongen–Jonker– Twilt regular) and two technical assumptions, (A1) and (A2), there exists a path in the set of stationary points connecting the chosen starting point for with a certain...