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 local limit theorem with speed of convergence for euclidean algorithms and diophantine costs
For large N, we consider the ordinary continued fraction of x=p/q with 1≤p≤q≤N, or, equivalently, Euclid’s gcd algorithm for two integers 1≤p≤q≤N, putting the uniform distribution on the set of p and qs. We study the distribution of the total cost of execution of the algorithm for an additive cost function c on the set ℤ+* of possible digits, asymptotically for N→∞. If c is nonlattice and satisfies mild growth conditions, the local limit theorem was proved previously by the second named author....
A Logic and computer algebra approach to a decision-making problem in medicine
A Logic Approach for Exceptions and Anomalies in Association Rules.
A Logic of Approximate Reasoning
A Logic with Big-stepped Probabilities That Can Model Nonmonotonic Reasoning of System P
A Logic With Higher Order Conditional Probabilities
A Logic With Higher Order Probabilities
A logical analysis of the truth-reaction paradox
A logical model of HCP.
A logic-based environment for developing natural language processing applications
We present a system providing a set of tools for developing natural language processing (NLP) applications such as natural language interfaces, communication aid systems, etc. This system is based on two principles: modularity of knowledge representation to ensure the portability of the system, and guided sentence composition to ensure transparency, i.e. to ensure that the produced sentences are well-formed at the lexical, syntactic, semantic and conceptual levels. We first describe the formalisms...
A Loopless Implementation of a Gray Code for Signed Permutations
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 lower bound for the arithmetical complexity of Sturmian words.
A Lyapunov-based design tool of impedance controllers for robot manipulators
This paper presents a design tool of impedance controllers for robot manipulators, based on the formulation of Lyapunov functions. The proposed control approach addresses two challenges: the regulation of the interaction forces, ensured by the impedance error converging to zero, while preserving a suitable path tracking despite constraints imposed by the environment. The asymptotic stability of an equilibrium point of the system, composed by full nonlinear robot dynamics and the impedance control,...
A Macsyma implementation of Zeilberger's fast algorithm.
A Markovian concurrency measure