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
International audienceWe present a new algorithm for generating uniformly at random words of any reg...
We consider the construction of finite automata from their corresponding regular expressions by a se...
Kleene algebra with tests (KAT) is an equational system that extends Kleene algebra, the algebra of ...
12 pagesInternational audienceGlushkov's algorithm builds an epsilon-free nondeterministic automaton...
International audienceWe study the average number of transitions in Glushkov automata built from ran...
In this paper, the relation between the Glushkov automaton (Apos) and the partial derivative automat...
AbstractGlushkov's algorithm computes a nondeterministic finite automaton without ε-transitions and ...
The partial derivative automaton (NFA_PD) is usually smaller than other non-deterministic finite aut...
AbstractIt is a well-established fact that each regular expression can be transformed into a nondete...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
Submitted, 21 pages.International audienceConsidering the uniform distribution on sets of m non-empt...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
AbstractThe number of transitions required by a nondeterministic finite automaton (NFA) to accept a ...
AbstractThe aim of this paper is to describe a CREW-PRAM optimal algorithm which converts a regular ...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
International audienceWe present a new algorithm for generating uniformly at random words of any reg...
We consider the construction of finite automata from their corresponding regular expressions by a se...
Kleene algebra with tests (KAT) is an equational system that extends Kleene algebra, the algebra of ...
12 pagesInternational audienceGlushkov's algorithm builds an epsilon-free nondeterministic automaton...
International audienceWe study the average number of transitions in Glushkov automata built from ran...
In this paper, the relation between the Glushkov automaton (Apos) and the partial derivative automat...
AbstractGlushkov's algorithm computes a nondeterministic finite automaton without ε-transitions and ...
The partial derivative automaton (NFA_PD) is usually smaller than other non-deterministic finite aut...
AbstractIt is a well-established fact that each regular expression can be transformed into a nondete...
Abstract. The problem of converting deterministic finite automata into (short) regular expressions i...
Submitted, 21 pages.International audienceConsidering the uniform distribution on sets of m non-empt...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
AbstractThe number of transitions required by a nondeterministic finite automaton (NFA) to accept a ...
AbstractThe aim of this paper is to describe a CREW-PRAM optimal algorithm which converts a regular ...
International audienceWe analyze the average complexity of Brzozowski's minimization algorithm for d...
International audienceWe present a new algorithm for generating uniformly at random words of any reg...
We consider the construction of finite automata from their corresponding regular expressions by a se...
Kleene algebra with tests (KAT) is an equational system that extends Kleene algebra, the algebra of ...
DOI
Add to ORKG