Results 241 to 250 of about 311,002 (284)
Some of the next articles are maybe not open access.
Some kinds of primitive and non-primitive words
Acta Informatica, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunhua, Cao, Shuang, Yang, Di, Yang
openaire +1 more source
Israel Journal of Mathematics, 1981
This note presents an example that disproves, forn=4, Weinbaum’s conjecture, that ifw is a cyclically reduced primitive word inF n such that all the generatorsx∈X appear inw then some cyclic permutation ofw can be partitioned inton words generatingF n :w≡uv,vu≡s 1 s 2…s n , =F n .
openaire +2 more sources
This note presents an example that disproves, forn=4, Weinbaum’s conjecture, that ifw is a cyclically reduced primitive word inF n such that all the generatorsx∈X appear inw then some cyclic permutation ofw can be partitioned inton words generatingF n :w≡uv,vu≡s 1 s 2…s n , =F n .
openaire +2 more sources
Counting Primitive Partial Words
2010A word is primitive if it is not a power of another word. The number of primitive words of a fixed length over an alphabet of a fixed size is well known and relates to the Möbius function. In this paper, we investigate the number of primitive partial words which are strings that may contain "do not know" symbols.
Blanchet-Sadri, Francine +1 more
openaire +1 more source
Applied Mathematics-A Journal of Chinese Universities, 2001
The author counts the primitive words of given length on a finite alphabet, as well as the ``exchangeable'' primitive words on a finite alphabet (a word is noexchangeable primitive if the word obtained by applying any permutation to the letters is still primitive). The first result is well known and can be found in any book on combinatorics on words (a
openaire +1 more source
The author counts the primitive words of given length on a finite alphabet, as well as the ``exchangeable'' primitive words on a finite alphabet (a word is noexchangeable primitive if the word obtained by applying any permutation to the letters is still primitive). The first result is well known and can be found in any book on combinatorics on words (a
openaire +1 more source
Formal languages and primitive words
Publicationes Mathematicae Debrecen, 1993Summary: The mathematical theory of formal languages has a very important role in theoretical computer science. In this paper we study various formal language problems related to the class of all primitive words over a fixed alphabet. Some results and problems are presented.
Dömösi, Pál +2 more
openaire +2 more sources
Primitivity of Atom Watson-Crick Fibonacci Words
2022Journal of Automata, Languages and Combinatorics, Volume 27, Numbers 1-3, 2022, 151 ...
Kari, Lila +3 more
openaire +2 more sources
ON A TOPOLOGY DEFINED BY PRIMITIVE WORDS
Missouri Journal of Mathematical Sciences, 2022A topological space \((X, \tau)\) is primal if there is a function \(f:X \rightarrow X\) such that \(U \in \tau\) if and only if \(f^{-1}(U) \subseteq U\). Given an alphabet \(A\), \(A^*\) (respectively, \(A^+\)) represents the set of all finite (respectively, nonempty finite) words from \(A\), with the operation of concatenation.
openaire +1 more source
Disjunctive languages related to $$p$$ -primitive words
Acta Informatica, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunhua, Cao, Di, Yang, Yin, Liu
openaire +2 more sources
A note on prefix primitive words
Acta Informatica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan, Chen-Ming, Huang, C. C.
openaire +2 more sources