Sciweavers

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

55

Voted

LATIN
1992
Springer

favoriteEmaildiscussreport

71views Information Technology» more LATIN 1992»

Regular Expressions into Finite Automata

15 years 1 months ago

Regular Expressions into Finite Automata

Download www.ma.hw.ac.uk

Anne Brüggemann-Klein

Real-time Traffic

Information Management | LATIN 1992 |

claim paper

Related Content

» An Algorithm for Transformation of Finite Automata to Regular Expressions

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

» State Elimination Ordering Strategies Some Experimental Results

» An Optimal Construction of Finite Automata from Regular Expressions

» Shorter Regular Expressions from FiniteState Automata

» Timed regular expressions

» A proof Procedure for Testing Membership in Regular Expressions

» Tight Bounds on the Descriptional Complexity of Regular Expressions

» Embedding Finite Automata within regular Expressions

» Short Regular Expressions from Finite Automata Empirical Results

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1992
Where	LATIN
Authors	Anne Brüggemann-Klein

Comments (0)