Sciweavers

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

17

IPL
2006

favoriteEmaildiscussreport

74views more IPL 2006»

Periodic and Sturmian languages

13 years 4 months ago

Periodic and Sturmian languages

Download combio.abo.fi

Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as for infinite words, we prove that this complexity functions f(n) is either bounded or f(n)

Lucian Ilie, Solomon Marcus, Ion Petre

Real-time Traffic

Distinct Factors | Infinite Words | IPL 2006 |

claim paper

Related Content

» Language structure of pattern Sturmian words

» Sturmian Trees

» A Characterization of Balanced Episturmian Sequences

» On minimal Sturmian partial words

» A characterization of fine words over a finite alphabet

» Asymptotic behavior in a heap model with two pieces

» Digital planarity A review

» A MultiPeriodic Synchronous DataFlow Language

» Scheduling Periodic Tasks in a Hard RealTime Environment

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Lucian Ilie, Solomon Marcus, Ion Petre

Comments (0)