Add to ORKGAbstract. We prove that, for any arbitrary finite alphabet and for the uniform distri-bution over deterministic and accessible automata with n states, the average complexity of Moore’s state minimization algorithm is in O(n log n). Moreover this bound is tight in the case of unary automata. 1
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
In this paper a particular family of deterministic automata that was built to reach the worst case c...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...
International audienceWe prove that, for any arbitrary finite alphabet and for the uniform distributi...
Submitted, 18 pages.International audienceWe prove that for the uniform distribution over accessible...
International audienceWe prove that the average complexity, for the uniform distribution on complete...
AbstractIn this paper we prove that for the uniform distribution on complete deterministic automata,...
International audienceDefine the complexity of a regular language as the number of states of its min...
International audienceWe prove that, for the uniform distribution over all sets X of m (that is a fi...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
International audienceWe study the distribution of the number of accessible states in deterministic ...
Abstract. The state complexity of a regular language is the number of states of its minimal determin...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
AbstractWe study the state complexity of certain simple languages. If A is an alphabet of k letters,...
AbstractThe number of states in a deterministic finite automaton (DFA) recognizing the language Lk, ...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
In this paper a particular family of deterministic automata that was built to reach the worst case c...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...
International audienceWe prove that, for any arbitrary finite alphabet and for the uniform distributi...
Submitted, 18 pages.International audienceWe prove that for the uniform distribution over accessible...
International audienceWe prove that the average complexity, for the uniform distribution on complete...
AbstractIn this paper we prove that for the uniform distribution on complete deterministic automata,...
International audienceDefine the complexity of a regular language as the number of states of its min...
International audienceWe prove that, for the uniform distribution over all sets X of m (that is a fi...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
International audienceWe study the distribution of the number of accessible states in deterministic ...
Abstract. The state complexity of a regular language is the number of states of its minimal determin...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
AbstractWe study the state complexity of certain simple languages. If A is an alphabet of k letters,...
AbstractThe number of states in a deterministic finite automaton (DFA) recognizing the language Lk, ...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
In this paper a particular family of deterministic automata that was built to reach the worst case c...
Abstract. We investigate the computational complexity of the nondeterministic finite automaton (NFA)...