Sciweavers

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

12

DLT
2008

favoriteEmaildiscussreport

107views Theoretical Computer Science» more DLT 2008»

Large Simple Binary Equality Words

13 years 6 months ago

Large Simple Binary Equality Words

Download www.karlin.mff.cuni.cz

Abstract. Let w be an equality word of two nonperiodic binary morphisms g, h : {a, b} . Suppose that no overflow occurs twice in w and that w contains at least 9 occurrences of a and at least 9 occurrences of b. Then either w = (ab)i a, or w = ai bj with gcd(i, j) = 1, up to the exchange of letters a and b.

Jana Hadravová, Stepan Holub

Real-time Traffic

DLT 2008 | Equality Word | Nonperiodic Binary Morphisms | Theoretical Computer Science |

claim paper

Related Content

» Tautologies over implication with negative literals

» Gaussian Process Person Identifier Based on Simple Floor Sensors

» On Efficient Construction of Decision Trees from Large Databases

» A general model for clustering binary data

» Retargetable binary utilities

» Periodicity and Correlation Properties of dFCSR Sequences

» Ranking the whole MEDLINE database according to a large training set using text indexing

» Towards billionbit optimization via a parallel estimation of distribution algorithm

» Optimum multiuser detection by nonsmooth optimization

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	DLT
Authors	Jana Hadravová, Stepan Holub

Comments (0)