We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative results
Abstract. We present two algorithms for minimizing deterministic frontier-to-root tree automata (dfr...
Abstract—During the process of minimizing a deterministic finite automaton, there exist computing de...
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA)...
We present a new incremental algorithm for minimising deterministic finite automata. It ru...
The determinization of a nondeterministic finite automaton (NFA) N is the process of generating a de...
The determinization of a nondeterministic finite automaton (FA) N is the process of generating a det...
In automata theory a minimization is the task of transforming a given finite state machine into an e...
Symbolic finite automata (SFAs) are generalizations of classical finite state automata. Whereas the ...
Abstract. There exists a linear time algorithm for the minimization of acyclic deter-ministic finite...
Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of d...
AbstractWe present a fast incremental algorithm for constructing minimal Deterministic Finite Cover ...
AbstractWe present a semi-incremental algorithm for constructing minimal acyclic deterministic finit...
We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
We present two algorithms for minimizing deterministic frontier-to-root tree automata (dfrtas) and c...
Abstract. We present two algorithms for minimizing deterministic frontier-to-root tree automata (dfr...
Abstract—During the process of minimizing a deterministic finite automaton, there exist computing de...
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA)...
We present a new incremental algorithm for minimising deterministic finite automata. It ru...
The determinization of a nondeterministic finite automaton (NFA) N is the process of generating a de...
The determinization of a nondeterministic finite automaton (FA) N is the process of generating a det...
In automata theory a minimization is the task of transforming a given finite state machine into an e...
Symbolic finite automata (SFAs) are generalizations of classical finite state automata. Whereas the ...
Abstract. There exists a linear time algorithm for the minimization of acyclic deter-ministic finite...
Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of d...
AbstractWe present a fast incremental algorithm for constructing minimal Deterministic Finite Cover ...
AbstractWe present a semi-incremental algorithm for constructing minimal acyclic deterministic finit...
We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
We present two algorithms for minimizing deterministic frontier-to-root tree automata (dfrtas) and c...
Abstract. We present two algorithms for minimizing deterministic frontier-to-root tree automata (dfr...
Abstract—During the process of minimizing a deterministic finite automaton, there exist computing de...
We present an efficient incremental algorithm for learning deterministic finite state automata (DFA)...
DOI
Add to ORKG