Generalized de Bruijn Words and the State Complexity of Conjugate Sets - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2019

Generalized de Bruijn Words and the State Complexity of Conjugate Sets

Daniel Gabric
  • Function : Author
  • PersonId : 1059508
Jeffrey Shallit

Abstract

We consider a certain natural generalization of de Bruijn words, and use it to compute the exact maximum state complexity for the language consisting of the conjugates of a single word. In other words, we determine the state complexity of cyclic shift on languages consisting of a single word.
Fichier principal
Vignette du fichier
480958_1_En_10_Chapter.pdf (328.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02387301 , version 1 (29-11-2019)

Licence

Attribution

Identifiers

Cite

Daniel Gabric, Štěpán Holub, Jeffrey Shallit. Generalized de Bruijn Words and the State Complexity of Conjugate Sets. 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.137-146, ⟨10.1007/978-3-030-23247-4_10⟩. ⟨hal-02387301⟩
28 View
30 Download

Altmetric

Share

Gmail Facebook X LinkedIn More