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

Generalized de Bruijn Words and the State Complexity of Conjugate Sets

Daniel Gabric
  • Function : Author
  • PersonId : 1059508
School of Computer Science [Waterloo]
Štěpán Holub
  • Function : Author
  • PersonId : 1059509
Faculty of Mathematics and Physics [Praha/Prague]
Jeffrey Shallit
School of Computer Science [Waterloo]

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.

Domains

Computer Science [cs]
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)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-02387301

Submitted on : Friday, November 29, 2019-4:36:17 PM

Last modification on : Sunday, January 14, 2024-11:50:06 PM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC1 IFIP-WG IFIP-DCFS IFIP-WG1-2 IFIP-LNCS-11612
40 View
54 Download

Altmetric

Share

More