Results 181 to 190 of about 4,855,672 (239)
Nondeterministic Moore Automata and Brzozowski’s Algorithm
International Conference on Implementation and Application of Automata, 2011 Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to ...
Giuseppa Castiglione +2 more
semanticscholar +5 more sources
Linear Nondeterministic Dawg String Matching Algorithm (Abstract)
SPIRE, 2004 The exact string matching problem is to find all the occurrences of a given pattern x=x 1 x 2 ··· x m in a large text y=y 1 y 2 ··· y n , where both x and y are sequences of symbols drawn from a finite character set Σ of size σ.
Longtao He, Binxing Fang
semanticscholar +4 more sources
Concurrent applicative implementations of nondeterministic algorithms
Computer Languages, 1983 In this paper we introduce a methodology for utilizing concurrency in place of backtracking in the implementation of nondeterministic algorithms. This is achieved in an applicative setting through the use of the Friedman-Wise multiprogramming primitive frons, and a paradigm which views the action of nondeterministic algorithms as one of data structure ...
Richard Salter
openalex +3 more sources
Identical transformations in algebras of nondeterministic algorithms. I
Cybernetics, 1986 This paper is the first attempt to study the question of completeness of systems of axioms in the algebra of algorithms which, in addition to closed elementary logical conditions, also allows a nondeterministic operation on operators. For algebras of nondeterministic algorithms with closed logical conditions, the so-called S(H)-algebras, we construct a
Yu. A. Yushchenko
openalex +3 more sources
Some algorithms for equivalent transformation of nondeterministic finite automata [PDF]
Russian Mathematics, 2009 In this paper we consider algorithms which allow one to combine several states of a nondeterministic finite automaton into one state. Along with the algorithms for combining states, we adduce one more algorithm for the equivalent transformation of a non-deterministic finite automaton, namely, an algorithm for adding cycles. Problems under consideration
Boris Melnikov, M. R. Saifullina
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A new algorithm of the state-minimization for the nondeterministic finite automata
Korean Journal of Computational & Applied Mathematics, 1999Summary: The problem of the state-minimization for the nondeterministic finite Rabin-Scott's automata is considered. A new algorithm for this problem is obtained. The obtained algorithm has the exponential effectiveness, like the earlier known algorithms for this problem.
B. Melnikov
openaire +4 more sources
An Integrated Deterministic and Nondeterministic Inference Algorithm for Sequential Labeling
Asia Information Retrieval Symposium, 2010In this paper, we present a new search algorithm for sequential labeling tasks based on the conditional Markov models (CMMs) frameworks. Unlike conventional beam search, our method traverses all possible incoming arcs and also considers the “local best” so-far of each previous node.
Yu Chieh Wu +3 more
openaire +3 more sources
A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
SIAM Journal on Matrix Analysis and Applications, 1990A parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices is presented. The algorithm D2 is based on a new nondeterministic parallel pivot search that finds a compatible pivot set${\bf S}$ of size m, followed by a parallel rank-m update. These two steps alternate until switching to dense matrix code or until the matrix
Timothy A. Davis, Pen-Chung Yew
openaire +3 more sources
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case
Programming and Computer Software, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. B. Bourdonov +2 more
openalex +4 more sources
2009 17th Mediterranean Conference on Control and Automation, 2009 Recently supervisor synthesis for nondeterministic systems has gained more and more attention, owing to the potential computational advantage of using nondeterministic automata in modular/distributed synthesis. It is well known that, in the Ramadge/Wonham language-based supervisory control paradigm, the supremal nonblocking normal supervisor always ...
Rong Su +2 more
openalex +3 more sources