206 search results - page 1 / 42 » Regular Expressions into Finite Automata |
INFORMATICALT
2000
13 years 7 months ago
2000
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 p...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
WIA
2005
Springer
14 years 25 days ago
2005
Springer
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...