Sciweavers

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

85

Voted

WIA
2007
Springer

86views Artificial Intelligence» more WIA 2007»

Efficient Enumeration of Regular Languages

15 years 9 months ago

Efficient Enumeration of Regular Languages

Download www.cs.uwaterloo.ca

Margareta Ackerman, Jeffrey Shallit

Real-time Traffic

Artificial Intelligence | WIA 2007 |

claim paper

Related Content

» Enumerating Regular Expressions and Their Languages

» Three New Algorithms for Regular Language Enumeration

» Additive Distances and QuasiDistances Between Words

» Accepting Networks of Evolutionary Processors with Subregular Filters

» Networks of Evolutionary Processors with Subregular Filters

» Odometers on Regular Languages

» Exhaustive Search Combinatorial Optimization and Enumeration Exploring the Potential of Ra...

» Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages

» Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WIA
Authors	Margareta Ackerman, Jeffrey Shallit

Comments (0)