An application of the Ehrenfeucht-Fraisse game in formal language theory
An application of the theory of intuitionistic fuzzy multigraphs.
In a recent paper by one of the authors it has been shown that there is a relationship between algebraic structures and labeled transition systems. Indeed, it has been shown that an algebraic structures can be viewed as labeled transition systems, which can also be viewed as multigraphs. In this paper, we extend this work by providing an estimation of the transition possibilities between vertices that are connected with multiarcs.
An approach to parallel algorithm design
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumäki on the characterization of the intersection of two submonoids of rank two, in the case of prefix (or suffix) generators. In a more general setting, for an arbitrary number of generators,...
An economical transformation of graph grammars
An efficient algorithm for computing real powers of a matrix and a related matrix function
The paper is devoted to an algorithm for computing matrices and for a given square matrix and a real . The algorithm uses the binary expansion of and has the logarithmic computational complexity with respect to . The problem stems from the control theory.
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
An embedding problem and its application in linguistics
An error recovery method for translations of LL(1)-languages [Abstract of thesis]
An exact performance bound for an time greedy matching procedure.
An extension of the MS pivoting rule to capacitated network flow problems
An extension of the notions of traces and of asynchronous automata
An Improved Algorithm for a Bicriteria Batching Scheduling Problem
This note is concerned with the bicriteria scheduling problem on a series-batching machine to minimize maximum cost and makespan. An O(n5) algorithm has been established previously. Here is an improved algorithm which solves the problem in O(n3) time.
An intensional approach to questions
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.
An introduction to probabilistic methods with applications
This special volume of the ESAIM Journal, Mathematical Modelling and Numerical Analysis, contains a collection of articles on probabilistic interpretations of some classes of nonlinear integro-differential equations. The selected contributions deal with a wide range of topics in applied probability theory and stochastic analysis, with applications in a variety of scientific disciplines, including physics, biology, fluid mechanics, molecular chemistry, financial mathematics and bayesian statistics....
An introduction to quantum annealing
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an example of proficuous cross contamination between classical and quantum computer science. In this survey paper we illustrate how hard combinatorial problems are tackled by quantum computation and present some examples of the heuristics provided by quantum annealing....
An introduction to quantum annealing
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an example of proficuous cross contamination between classical and quantum computer science. In this survey paper we illustrate how hard combinatorial problems are tackled by quantum computation and present some examples of the heuristics provided by quantum annealing....
An O(n log n) Algorithm for the All-Nearest-Neighbors Problem.
An O(n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.