Sciweavers

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

36

INFORMATICALT
2000

favoriteEmaildiscussreport

160views more INFORMATICALT 2000»

An Algorithm for Transformation of Finite Automata to Regular Expressions

13 years 10 months ago

An Algorithm for Transformation of Finite Automata to Regular Expressions

Download www.mii.lt

An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new proof of equivalence of regular expressions and finite automata. Key words: regular sets, finite automata, construction of regular expressions.

Larisa Stanevichene, Aleksei Vylitok

Real-time Traffic

Algorithms | Effective Graph Algorithms | INFORMATICALT 2000 | Regular Expressions |

claim paper

Related Content

» Explicitly Parallel Regular Expressions

» State Elimination Ordering Strategies Some Experimental Results

» Algorithms to accelerate multiple regular expressions matching for deep packet inspection

» Embedding Finite Automata within regular Expressions

» Short Regular Expressions from Finite Automata Empirical Results

» A proof Procedure for Testing Membership in Regular Expressions

» Testing the Equivalence of Regular Languages

» Curing regular expressions matching algorithms from insomnia amnesia and acalculia

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	INFORMATICALT
Authors	Larisa Stanevichene, Aleksei Vylitok

Comments (0)