scientific article
From MaRDI portal
Publication:3104397
zbMath1234.68224MaRDI QIDQ3104397
Publication date: 19 December 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydecidabilityChomsky hierarchycombinatorics on wordsperiodicity of wordscontextual languagesprimitivity of wordspowers of languagesroots of words and languages
Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (4)
String rearrangement inequalities and a total order between primitive words ⋮ Spectrum Maximizing Products Are Not Generically Unique ⋮ Some kinds of primitive and non-primitive words ⋮ On the Language of Primitive Partial Words
This page was built for publication:
