State complexity of multiple catenation - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

State complexity of multiple catenation

(1, 2) , (1, 2) , (1, 2)
1
2

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.

Dates and versions

hal-02088131 , version 1 (02-04-2019)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More