The search functionality is under construction.

The search functionality is under construction.

In this paper, we give some resuts on primitive words, square-free words and disjunctive languages. We show that for a word *u* ∈Σ^{+}, every element of λ(*cp*(*u*)) is d-primitive iff it is square-free, where *cp*(*u*) is the set of all cyclic-permutations of *u*, and λ(*cp*(*u*)) is the set of all primitive roots of it. Next we show that *p ^{m}q^{n}* is a primitive word for every

- Publication
- IEICE TRANSACTIONS on Information Vol.E91-D No.10 pp.2514-2516

- Publication Date
- 2008/10/01

- Publicized

- Online ISSN
- 1745-1361

- DOI
- 10.1093/ietisy/e91-d.10.2514

- Type of Manuscript
- LETTER

- Category
- Automata and Formal Language Theory

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Tetsuo MORIYA, "Some Results on Primitive Words, Square-Free Words, and Disjunctive Languages" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 10, pp. 2514-2516, October 2008, doi: 10.1093/ietisy/e91-d.10.2514.

Abstract: In this paper, we give some resuts on primitive words, square-free words and disjunctive languages. We show that for a word *u* ∈Σ^{+}, every element of λ(*cp*(*u*)) is d-primitive iff it is square-free, where *cp*(*u*) is the set of all cyclic-permutations of *u*, and λ(*cp*(*u*)) is the set of all primitive roots of it. Next we show that *p ^{m}q^{n}* is a primitive word for every

URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.10.2514/_p

Copy

@ARTICLE{e91-d_10_2514,

author={Tetsuo MORIYA, },

journal={IEICE TRANSACTIONS on Information},

title={Some Results on Primitive Words, Square-Free Words, and Disjunctive Languages},

year={2008},

volume={E91-D},

number={10},

pages={2514-2516},

abstract={In this paper, we give some resuts on primitive words, square-free words and disjunctive languages. We show that for a word *u* ∈Σ^{+}, every element of λ(*cp*(*u*)) is d-primitive iff it is square-free, where *cp*(*u*) is the set of all cyclic-permutations of *u*, and λ(*cp*(*u*)) is the set of all primitive roots of it. Next we show that *p ^{m}q^{n}* is a primitive word for every

keywords={},

doi={10.1093/ietisy/e91-d.10.2514},

ISSN={1745-1361},

month={October},}

Copy

TY - JOUR

TI - Some Results on Primitive Words, Square-Free Words, and Disjunctive Languages

T2 - IEICE TRANSACTIONS on Information

SP - 2514

EP - 2516

AU - Tetsuo MORIYA

PY - 2008

DO - 10.1093/ietisy/e91-d.10.2514

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E91-D

IS - 10

JA - IEICE TRANSACTIONS on Information

Y1 - October 2008

AB - In this paper, we give some resuts on primitive words, square-free words and disjunctive languages. We show that for a word *u* ∈Σ^{+}, every element of λ(*cp*(*u*)) is d-primitive iff it is square-free, where *cp*(*u*) is the set of all cyclic-permutations of *u*, and λ(*cp*(*u*)) is the set of all primitive roots of it. Next we show that *p ^{m}q^{n}* is a primitive word for every

ER -