The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 원시어, 정사각형 없는 단어 및 분리형 언어에 대한 몇 가지 결과를 제공합니다. 우리는 그것을 한마디로 보여줍니다 u ∈Σ+, λ(의 모든 요소cp(u))는 정사각형이 없는 경우 d-원시적입니다. 여기서 cp(u)는 다음의 모든 순환 순열의 집합입니다. u, 및 λ(cp(u))는 그것의 모든 기본 뿌리의 집합입니다. 다음으로 우리는 그것을 보여줍니다 pmqn 모든 것에 대한 원시적인 단어이다. n, m ≥1 및 원시 단어 p, q, 조건 하에서 |p| = |q| 그리고 (m, n) ≠ (1, 1). 우리는 또한 언어에 대한 분리성 조건을 제공합니다.
원시어, 정사각형 없는 단어, 주요 합동, 분리형 언어
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.
부
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 pmqn is a primitive word for every n, m ≥1 and primitive words p, q, under the condition that |p| = |q| and (m, n) ≠ (1, 1). We also give a condition of disjunctiveness for a language.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.10.2514/_p
부
@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 pmqn is a primitive word for every n, m ≥1 and primitive words p, q, under the condition that |p| = |q| and (m, n) ≠ (1, 1). We also give a condition of disjunctiveness for a language.},
keywords={},
doi={10.1093/ietisy/e91-d.10.2514},
ISSN={1745-1361},
month={October},}
부
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 pmqn is a primitive word for every n, m ≥1 and primitive words p, q, under the condition that |p| = |q| and (m, n) ≠ (1, 1). We also give a condition of disjunctiveness for a language.
ER -