Results 261 to 270 of about 24,121 (290)

Marcus contextual languages consisting of primitive words

Discrete Mathematics, 2008
In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual ...
Ito, Masami, Marcus, Solomon, Dömösi, Pál   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Some kinds of primitive and non-primitive words

Acta Informatica, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunhua Cao, Shuang Yang, Di Yang 0004
openaire   +1 more source

A note on prefix primitive words

Acta Informatica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen-Ming Fan, Cheng-Chih Huang
openaire   +2 more sources

Generalized periodicity and primitivity for words

Mathematical Logic Quarterly, 2007
AbstractStarting from six kinds of periodicity of words we define six sets of words which are primitive in different senses and we investigate their relationships. We show that only three of the sets are external Marcus contextual languages with choice but none of them is an external contextual language without choice or an internal contextual language.
Masami Ito, Gerhard Lischke
openaire   +1 more source

ON A TOPOLOGY DEFINED BY PRIMITIVE WORDS

Missouri Journal of Mathematical Sciences, 2022
A 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

On the Unavoidability of Primitive Words and other Languages

J. Autom. Lang. Comb., 2021
Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 91 ...
openaire   +2 more sources

Counting Primitive Partial Words

J. Autom. Lang. Comb., 2010
A 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.
Francine Blanchet-Sadri, Mihai Cucuringu
openaire   +1 more source

On the Language of Primitive Partial Words

2015
A partial word is a word which contains some holes known as do not know symbols and such places can be replaced by any letter from the underlying alphabet. We study the relation between language of primitive partial words with the conventional language classes viz. regular, linear and deterministic context-free in Chomsky hierarchy.
Ananda Chandra Nayak, Kalpesh Kapoor
openaire   +1 more source

Derivating Primitive Words

2014
exaly   +2 more sources

The ambiguity of primitive words

1994
A word is primitive if it is not a proper power of a shorter word. We prove that the set Q of primitive words over an alphabet is not an unambiguous context-free language. This strengthens the previous result that Q cannot be deterministic context-free. Further we show that the same holds for the set L of Lyndon words. We describe 2DPDA accepting Q and
openaire   +1 more source