Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

LATA
2009
Springer

favoriteEmaildiscussreport

104views Artificial Intelligence» more LATA 2009»

On the Average Size of Glushkov's Automata

13 years 11 months ago

On the Average Size of Glushkov's Automata

Download www.ncc.up.pt

Abstract. Glushkov’s algorithm builds an ε-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.

Cyril Nicaud

Real-time Traffic

Automata Theory | LATA 2009 | Regular Expression | Worst Case | ε-free Nondeterministic Automaton |

claim paper

Related Content

» Average Analysis of Glushkov Automata under a BSTLike Model

» On the Average Number of States of Partial Derivative Automata

» The Average State Complexity of the Star of a Finite Set of Words Is Linear

» Comprehensive pathsensitive dataflow analysis

» Solving string constraints lazily

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	LATA
Authors	Cyril Nicaud

Comments (0)