Add to ORKGInternational audienceWe prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX, one of the usual deterministic automata recognizing X*, has on average O(n) states and that the average state complexity of X* is O(n). We also show that the average time complexity of the computation of the automaton DX is O(n log n), when the alphabet is of size at least three
AbstractWe study the state complexity of certain simple languages. If A is an alphabet of k letters,...
Submitted, 21 pages.International audienceConsidering the uniform distribution on sets of m non-empt...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty...
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distri-bution over de...
International audienceWe prove that, for any arbitrary finite alphabet and for the uniform distributi...
International audienceDefine the complexity of a regular language as the number of states of its min...
International audienceWe prove that the average complexity, for the uniform distribution on complete...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
AbstractIn this paper we prove that for the uniform distribution on complete deterministic automata,...
Submitted, 18 pages.International audienceWe prove that for the uniform distribution over accessible...
AbstractThe number of states in a deterministic finite automaton (DFA) recognizing the language Lk, ...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
International audienceWe study the distribution of the number of accessible states in deterministic ...
Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we est...
AbstractWe study the state complexity of certain simple languages. If A is an alphabet of k letters,...
Submitted, 21 pages.International audienceConsidering the uniform distribution on sets of m non-empt...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty...
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distri-bution over de...
International audienceWe prove that, for any arbitrary finite alphabet and for the uniform distributi...
International audienceDefine the complexity of a regular language as the number of states of its min...
International audienceWe prove that the average complexity, for the uniform distribution on complete...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
AbstractIn this paper we prove that for the uniform distribution on complete deterministic automata,...
Submitted, 18 pages.International audienceWe prove that for the uniform distribution over accessible...
AbstractThe number of states in a deterministic finite automaton (DFA) recognizing the language Lk, ...
AbstractWe investigate the average-case state and transition complexity of deterministic and nondete...
International audienceWe study the distribution of the number of accessible states in deterministic ...
Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we est...
AbstractWe study the state complexity of certain simple languages. If A is an alphabet of k letters,...
Submitted, 21 pages.International audienceConsidering the uniform distribution on sets of m non-empt...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...