Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

State complexity of multiple catenation

Pascal Caron 1, 2 Jean-Gabriel Luque 1, 2 Bruno Patrou 1, 2 
1 CA - LITIS - Equipe Combinatoire et algorithmes
LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
Abstract : We improve some results relative to the state complexity of the multiple catenation described by Gao and Yu. In particular we nearly divide by 2 the size of the alphabet needed for witnesses. We also give some refinements to the algebraic expression of the state complexity, which is especially complex with this operation. We obtain these results by using peculiar DFAs defined by Brzozowski.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Pascal Caron Connect in order to contact the contributor
Submitted on : Tuesday, April 2, 2019 - 3:46:44 PM
Last modification on : Wednesday, March 2, 2022 - 10:10:10 AM

Links full text


  • HAL Id : hal-02088131, version 1
  • ARXIV : 1607.04031


Pascal Caron, Jean-Gabriel Luque, Bruno Patrou. State complexity of multiple catenation. 2019. ⟨hal-02088131⟩



Record views