Conference Papers Year : 2016

Unrestricted State Complexity of Binary Operations on Regular Languages

Janusz Brzozowski
  • Function : Author
  • PersonId : 1022710

Abstract

I study the state complexity of binary operations on regular languages over different alphabets. It is well known that if Lm

and Ln
are languages restricted to be over the same alphabet, with m and n quotients, respectively, the state complexity of any binary boolean operation on Lm
and Ln
is mn, and that of the product (concatenation) is (m1)2n+2n1
. In contrast to this, I show that if Lm
and Ln
are over their own different alphabets, the state complexity of union and symmetric difference is mn+m+n+1
, that of intersection is mn+1
, that of difference is mn+m+1
, and that of the product is m2n+2n1
.

Fichier principal
Vignette du fichier
416473_1_En_5_Chapter.pdf (187) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01633951 , version 1 (13-11-2017)

Licence

Identifiers

Cite

Janusz Brzozowski. Unrestricted State Complexity of Binary Operations on Regular Languages. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.60-72, ⟨10.1007/978-3-319-41114-9_5⟩. ⟨hal-01633951⟩
81 View
70 Download

Share

  • More