Sciweavers

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

5

DMTCS
2010

favoriteEmaildiscussreport

109views Mathematics» more DMTCS 2010»

On the number of balanced words of given length and height over a two letter alphabet

13 years 1 months ago

On the number of balanced words of given length and height over a two letter alphabet

Download www.loria.fr

Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Je

Real-time Traffic

DMTCS 2010 | Sensor Networks |

claim paper

Related Content

» On minimal Sturmian partial words

» Asymptotic behaviour and optimal word size for exact and approximate word matches between ...

» Closure of Language Classes Under Bounded Duplication

» An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms

» On the Complexity of the Whitehead Minimization Problem

» Probabilistic models for pattern statistics

Post Info
More Details (n/a)

Added	02 Mar 2011
Updated	02 Mar 2011
Type	Journal
Year	2010
Where	DMTCS
Authors	Nicolas Bedaride, Eric Domenjoud, Damien Jamet, Jean-Luc Remy

Comments (0)