Sciweavers

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

30

STACS
2007
Springer

favoriteEmaildiscussreport

79views Theoretical Computer Science» more STACS 2007»

On the Size of the Universal Automaton of a Regular Language

14 years 5 months ago

On the Size of the Universal Automaton of a Regular Language

Download www-i7.informatik.rwth-aachen.de

Sylvain Lombardy

Real-time Traffic

STACS 2007 | Theoretical Computer Science |

claim paper

Related Content

» A Universal Kernel for Learning Regular Languages

» A Particular Universal Cellular Automaton

» An Optimal Construction of Finite Automata from Regular Expressions

» Two Size Measures for Timed Languages

» Unfolding Synthesis of Asynchronous Automata

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

» Embedding Finite Automata within regular Expressions

» CacheBased Scalable Deep Packet Inspection with Predictive Automaton

» The HOM problem is decidable

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	STACS
Authors	Sylvain Lombardy

Comments (0)