Sciweavers

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

23

IANDC
2008

favoriteEmaildiscussreport

75views more IANDC 2008»

On finite alphabets and infinite bases

13 years 11 months ago

On finite alphabets and infinite bases

Download www.cs.vu.nl

Taolue Chen, Wan Fokkink, Bas Luttik, Sumit Nain

Real-time Traffic

IANDC 2008 |

claim paper

Related Content

» On Finite Alphabets and Infinite Bases II Completed and Ready Simulation

» On Finite Alphabets and Infinite Bases III Simulation

» On Finite Alphabets and Infinite Bases From Ready Pairs to Possible Worlds

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

» A characterization of fine words over a finite alphabet

» Relationship among Complexities of Individual Sequences over Countable Alphabet

» Regular Expressions for Languages over Infinite Alphabets

» Automata and Logics for Words and Trees over an Infinite Alphabet

» Variable Automata over Infinite Alphabets

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	IANDC
Authors	Taolue Chen, Wan Fokkink, Bas Luttik, Sumit Nain

Comments (0)