The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] regular component(1hit)

1-1hit
  • d-Primitive Words and D(1)-Concatenated Words

    Itaru KATAOKA  Tetsuo MORIYA  

     
    LETTER-Automata and Formal Language Theory

      Vol:
    E92-D No:8
      Page(s):
    1577-1579

    In this paper, we study d-primitive words and D(1)-concatenated words. First we show that neither D(1), the set of all d-primitive words, nor D(1)D(1), the set of all D(1)-concatenated words, is regular. Next we show that for u, v, w ∈Σ+ with |u|=|w|, uvw ∈ D(1) if and only if uv+w ⊆ D(1). It is also shown that every d-primitive word, with the length of two or more, is D(1)-concatenated.