Results 1  10
of
942
Deterministic Automaton with Unobservable Event
"... One of the key stages of the development of a fault tolerant Service oriented Architecture is the creation of Diagnosers, which monitors the system’s behaviour to identify the occurrence of failure. This paper presents a Model Driven Development (MDD) approach to the automated creation of the Diagno ..."
Abstract
 Add to MetaCart
One of the key stages of the development of a fault tolerant Service oriented Architecture is the creation of Diagnosers, which monitors the system’s behaviour to identify the occurrence of failure. This paper presents a Model Driven Development (MDD) approach to the automated creation of the Diagnosing Services and integrating them into the system. The outline of the method is as follows. BPEL models of the services are transformed to
BY MEANS OF A FINITE DETERMINISTIC AUTOMATON By
, 1977
"... The materials in this paper are elementary. A language L over an alphabet I is said to be regular if L=1ctl for some regular expression ct over I. It is familiar in [5, Chap. 1, g2], [2] and [4] that every language of this kind is represented by a certain finite deterministic automaton A. The format ..."
Abstract
 Add to MetaCart
The materials in this paper are elementary. A language L over an alphabet I is said to be regular if L=1ctl for some regular expression ct over I. It is familiar in [5, Chap. 1, g2], [2] and [4] that every language of this kind is represented by a certain finite deterministic automaton A
A Partial Deterministic Automaton for Approximate String Matching
 In Proc. of Fourth South American Workshop on String Processing (WSP'97
, 1997
"... . One of the simplest approaches to approximate string matching is to consider the associated nondeterministic finite automaton and make it deterministic. Besides automaton generation, the search time is O(n) in the worst case, where n is the text size. This solution is mentioned in the classical ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
. One of the simplest approaches to approximate string matching is to consider the associated nondeterministic finite automaton and make it deterministic. Besides automaton generation, the search time is O(n) in the worst case, where n is the text size. This solution is mentioned in the classical
An n log n algorithm for hyperminimizing a (minimized) deterministic automaton
 THEOR. COMPUT. SCI
, 2010
"... We improve a recent result [Badr: Hyperminimization in O(n²). Int. J. Found. Comput. Sci. 20, 2009] for hyperminimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic finite automaton (dfa) an almostequivalent dfa that is as small as possible suc ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
We improve a recent result [Badr: Hyperminimization in O(n²). Int. J. Found. Comput. Sci. 20, 2009] for hyperminimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic finite automaton (dfa) an almostequivalent dfa that is as small as possible
Distribution of the number of accessible states in a random deterministic automaton
 In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012
, 2012
"... We study the distribution of the number of accessible states in deterministic and complete automata with n states over a kletters alphabet. We show that as n tends to infinity and for a fixed alphabet size, the distribution converges in law toward a Gaussian centered around vkn and of standard devi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We study the distribution of the number of accessible states in deterministic and complete automata with n states over a kletters alphabet. We show that as n tends to infinity and for a fixed alphabet size, the distribution converges in law toward a Gaussian centered around vkn and of standard
An n log n Algorithm for HyperMinimizing States in a (Minimized) Deterministic Automaton
, 2009
"... ..."
An Improved Construction of Deterministic Omegaautomaton using Derivatives
"... Abstract. In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by an ωregular expression. The construction was related to a determinization method invented by Safra. This paper describes a new construction, inspired by Piterman&ap ..."
Abstract
 Add to MetaCart
Abstract. In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by an ωregular expression. The construction was related to a determinization method invented by Safra. This paper describes a new construction, inspired by Piterman
A Deterministic Sandpile Automaton Revisited
, 1999
"... . The BakTangWiesenfeld (BTW) sandpile model is a cellular automaton which has been intensively studied during the last years as a paradigm for selforganized criticality. In this paper, we reconsider a deterministic version of the BTW model introduced by Wiesenfeld, Theiler and McNamara, where sa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. The BakTangWiesenfeld (BTW) sandpile model is a cellular automaton which has been intensively studied during the last years as a paradigm for selforganized criticality. In this paper, we reconsider a deterministic version of the BTW model introduced by Wiesenfeld, Theiler and McNamara, where
Processing XML Streams with deterministic automata
, 2003
"... Abstract. We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can be used effectively for this problem: in our experiments we achieve a throughput of about 5.4MB/s, independent ..."
Abstract

Cited by 159 (4 self)
 Add to MetaCart
Abstract. We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can be used effectively for this problem: in our experiments we achieve a throughput of about 5.4MB/s, independent
Results 1  10
of
942