Add to ORKGInternational audienceWe develop a O(m log n)-time and O(k + n + m)-space algorithm for minimizing incomplete deterministic automata, where n is the number of states, m the number of edges, and k the size of the alphabet. Minimization reduces to the partial Functional coarsest partition problem. Our algorithm is a slight variant of Hopcroft's algorithm for minimizing deterministic complete automata
AbstractIn this paper we present an O(n2) implementation of Moore's algorithm for automata minimizat...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
We present a minimization algorithm for finite state automata that finds and merges bisimulation-equ...
International audienceWe design an algorithm that minimizes irreducible deterministic local automata...
Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of d...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
AbstractThe problem of finding the coarsest partition of a set S with respect to another partition o...
The problem of finding the coarsest partition of a set S with respect to another partition of S one ...
Abstract—During the process of minimizing a deterministic finite automaton, there exist computing de...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
In automata theory a minimization is the task of transforming a given finite state machine into an e...
Minimization of deterministic finite automata is a largely studied problem of the Theory of Automata...
This paper studies the algorithms for the minimisation of weighted automata. It starts with the defi...
AbstractJ. Hopcroft introduced already in 1970 an O(nlogn)-time algorithm for minimizing a finite de...
In this paper a particular family of deterministic automata that was built to reach the worst case c...
AbstractIn this paper we present an O(n2) implementation of Moore's algorithm for automata minimizat...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
We present a minimization algorithm for finite state automata that finds and merges bisimulation-equ...
International audienceWe design an algorithm that minimizes irreducible deterministic local automata...
Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of d...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
AbstractThe problem of finding the coarsest partition of a set S with respect to another partition o...
The problem of finding the coarsest partition of a set S with respect to another partition of S one ...
Abstract—During the process of minimizing a deterministic finite automaton, there exist computing de...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
In automata theory a minimization is the task of transforming a given finite state machine into an e...
Minimization of deterministic finite automata is a largely studied problem of the Theory of Automata...
This paper studies the algorithms for the minimisation of weighted automata. It starts with the defi...
AbstractJ. Hopcroft introduced already in 1970 an O(nlogn)-time algorithm for minimizing a finite de...
In this paper a particular family of deterministic automata that was built to reach the worst case c...
AbstractIn this paper we present an O(n2) implementation of Moore's algorithm for automata minimizat...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
We present a minimization algorithm for finite state automata that finds and merges bisimulation-equ...