default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 601
Volume 601, October 2015
- Juhani Karhumäki, Luca Q. Zamboni:
Words 2013. 1
- Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
Periodicity forcing words. 2-14 - Mari Ernvall, Vesa Halava, Tero Harju
:
On the n-permutation Post Correspondence Problem. 15-20 - Juha Honkala:
Language-theoretic problems in certain matrix monoids. 21-28 - Tero Harju, Mike Müller:
Square-free shuffles of words. 29-38 - Michaël Rao:
On some generalizations of abelian power avoidability. 39-46 - Michel Rigo, Pavel Salimov:
Another generalization of abelian equivalence: Binomial complexity of infinite words. 47-57 - Giusi Castiglione, Marinella Sciortino:
Standard Sturmian words and automata minimization algorithms. 58-66 - Arseny M. Shur:
Generating square-free words efficiently. 67-72
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-18 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
