Periodic and Sturmian languages

DOI10.1016/J.IPL.2005.05.029MaRDI QIDQ844208zbMATH OpenOpenAlexFDO

Authors Lucian Ilie, Solomon Marcus, Ion Petre

Publication date 18 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.05.029

zbMATH Keywords

formal languagesperiodicinfinite wordsSturmianlanguagesfactors

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Periodic D0L languages
• Generalized Sturmian languages
• Language structure of pattern Sturmian words
• On a class of irregular languages
• Aspects of Molecular Computing
• A new family of nonstochastic languages
• Cyclic languages and strongly cyclic languages
• scientific article; zbMATH DE number 3862470
• Circular languages
• A hierarchy of cyclic languages

Cites work

• scientific article; zbMATH DE number 3880130 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3755897 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 1408345 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• scientific article; zbMATH DE number 3415406 (Why is no real title available?)
• A characterization of poly-slender context-free languages
• H-bounded and semi-discrete languages
• Numeration systems, linear recurrences, and regular sets
• On a conjecture about slender context-free languages
• Semi-discrete context-free languages^†
• Sequences with minimal block growth
• Thin and slender languages

Cited in

(11)

• Linear complexity words and surface laminations
• Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
• On the character of words of sublinear complexity
• Comparing Complexity Functions of a Language and Its Extendable Part
• Partitioned factors in Christoffel and Sturmian words
• A lower bound for the arithmetical complexity of Sturmian words
• Language structure of pattern Sturmian words
• On the arithmetical complexity of Sturmian words
• scientific article; zbMATH DE number 1408358 (Why is no real title available?)
• On the Lie complexity of Sturmian words
• Generalized Sturmian languages

This page was built for publication: Periodic and Sturmian languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844208)