12 pagesInternational audienceGlushkov's algorithm builds an epsilon-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of transitions is quadratic in the size of the expression. We show in this paper that in average, the number of transitions is linear
AbstractWe show that every regular expression of size n over a fixed alphabet of s symbols can be co...
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...
12 pagesInternational audienceGlushkov's algorithm builds an epsilon-free nondeterministic automaton...
In this paper, the relation between the Glushkov automaton (Apos) and the partial derivative automat...
International audienceWe study the average number of transitions in Glushkov automata built from ran...
AbstractIt is a well-established fact that each regular expression can be transformed into a nondete...
AbstractGlushkov's algorithm computes a nondeterministic finite automaton without ε-transitions and ...
Kleene algebra with tests (KAT) is an equational system that extends Kleene algebra, the algebra of ...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
AbstractA regular expression with n occurrences of symbol can be converted into an equivalent automa...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
International audienceWe study the distribution of the number of accessible states in deterministic ...
International audienceDefine the complexity of a regular language as the number of states of its min...
AbstractWe show that every regular expression of size n over a fixed alphabet of s symbols can be co...
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...
12 pagesInternational audienceGlushkov's algorithm builds an epsilon-free nondeterministic automaton...
In this paper, the relation between the Glushkov automaton (Apos) and the partial derivative automat...
International audienceWe study the average number of transitions in Glushkov automata built from ran...
AbstractIt is a well-established fact that each regular expression can be transformed into a nondete...
AbstractGlushkov's algorithm computes a nondeterministic finite automaton without ε-transitions and ...
Kleene algebra with tests (KAT) is an equational system that extends Kleene algebra, the algebra of ...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
AbstractA regular expression with n occurrences of symbol can be converted into an equivalent automa...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
International audienceWe study the distribution of the number of accessible states in deterministic ...
International audienceDefine the complexity of a regular language as the number of states of its min...
AbstractWe show that every regular expression of size n over a fixed alphabet of s symbols can be co...
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...
DOI
Add to ORKG