Results 21  30
of
1,074
Partial Derivatives of Regular Expressions and Finite Automata Constructions
 Theoretical Computer Science
, 1995
"... . We introduce a notion of a partial derivative of a regular expression. It is a generalization to the nondeterministic case of the known notion of a derivative invented by Brzozowski. We give a constructive definition of partial derivatives, study their properties, and employ them to develop a new ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
introduced word derivatives of regular expressions and suggested an elegant algorithm turning a regular expression r into a deterministic finite automata (DFA); the main point of the algorithm is that the word derivatives of r serve as states of the resulting DFA [5]. In the following years derivatives were
The Complexity of Probabilistic versus Deterministic Finite Automata
 Proceedings of the International Symposium on Algorithms and Computation (ISAAC'96), Lecture Notes in Computer Science 1178
, 1996
"... . We show that there exists probabilistic nite automata with an isolated cutpoint and n states such that the smallest equivalent deterministic nite automaton contains (2 n log log n log n ) states. Keywords: Automata theory, the complexity of nite automata, probabilistic nite automata. 1 Introd ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
. We show that there exists probabilistic nite automata with an isolated cutpoint and n states such that the smallest equivalent deterministic nite automaton contains (2 n log log n log n ) states. Keywords: Automata theory, the complexity of nite automata, probabilistic nite automata. 1
Converting Deterministic Finite Automata to Regular Expressions
, 2005
"... This paper explores three techniques for converting deterministic finite automata (DFA) to regular expressions and compares the usefulness of each technique. The techniques examined are the transitive closure method, the state removal method, and the Brzozowski algebraic method. 1 ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper explores three techniques for converting deterministic finite automata (DFA) to regular expressions and compares the usefulness of each technique. The techniques examined are the transitive closure method, the state removal method, and the Brzozowski algebraic method. 1
On the Representation of Finite Deterministic 2Tape Automata
, 1998
"... This paper presents properties of relations between words that are realized by deterministic finite 2tape automata. It has been made as complete as possible, and is structured by the systematic use of the matrix representation of automata. It is first shown that deterministic 2tape automata are c ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This paper presents properties of relations between words that are realized by deterministic finite 2tape automata. It has been made as complete as possible, and is structured by the systematic use of the matrix representation of automata. It is first shown that deterministic 2tape automata
On the Secure Obfuscation of Deterministic Finite Automata (Extended Abstract)
, 2008
"... In this paper, we show how to construct secure obfuscation for Deterministic Finite Automata, assuming nonuniformly strong oneway functions exist. We revisit the software protection approaches originally proposed by [5, 10, 12, 17] and revise them to the current obfuscation setting of Barak et al. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper, we show how to construct secure obfuscation for Deterministic Finite Automata, assuming nonuniformly strong oneway functions exist. We revisit the software protection approaches originally proposed by [5, 10, 12, 17] and revise them to the current obfuscation setting of Barak et al
Deterministic Finite Automata in the Detection of EEG Spikes and Seizures
"... Abstract. This Paper presents a platform to mine epileptiform activity from Electroencephalograms (EEG) by combining the methodologies of Deterministic Finite Automata (DFA) and Knowledge Discovery in Data Mining (KDD) TVTree. Mining EEG patterns in human brain dynamics is complex yet necessary for ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. This Paper presents a platform to mine epileptiform activity from Electroencephalograms (EEG) by combining the methodologies of Deterministic Finite Automata (DFA) and Knowledge Discovery in Data Mining (KDD) TVTree. Mining EEG patterns in human brain dynamics is complex yet necessary
Exact Generation of Minimal Acyclic Deterministic Finite Automata
, 2007
"... We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase, that would be needed if a generation algori ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We give a canonical representation for minimal acyclic deterministic finite automata (MADFA) with n states over an alphabet of k symbols. Using this normal form, we present a method for the exact generation of MADFAs. This method avoids a rejection phase, that would be needed if a generation
Implementation of Deterministic Finite Automata on Parallel Computers ∗
"... We present implementations of parallel DFA run methods. We compare the parallel methods with well known sequential versions of these methods and find whether and under what conditions is worthy to use the parallel methods of simulation of run of finite automata. We introduce the paralell DFA run met ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We present implementations of parallel DFA run methods. We compare the parallel methods with well known sequential versions of these methods and find whether and under what conditions is worthy to use the parallel methods of simulation of run of finite automata. We introduce the paralell DFA run
Exact Generation of Acyclic Deterministic Finite Automata
, 2008
"... We give a canonical representation for trim acyclic deterministic finite automata (ADFA) with n states over an alphabet of k symbols. Using this normal form, we present a backtracking algorithm for the exact generation of ADFAs. This algorithm is a non trivial adaptation of the algorithm for the ex ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give a canonical representation for trim acyclic deterministic finite automata (ADFA) with n states over an alphabet of k symbols. Using this normal form, we present a backtracking algorithm for the exact generation of ADFAs. This algorithm is a non trivial adaptation of the algorithm
Hyperminimisation of deterministic weighted finite automata . . .
"... Hyperminimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal po ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Hyperminimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal
Results 21  30
of
1,074