VOLUME 7

2002

NUMBER 3

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages

Cezar Câmpeanu, Kai Salomaa, Sheng Yu

Pages 303–310

Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX

BibTeX:

@article{JALC-2002-303,
  author  = {Cezar C{\^{a}}mpeanu and Kai Salomaa and Sheng Yu},
  title   = {Tight Lower Bound for the State Complexity of Shuffle of Regular Languages},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {7},
  number  = {3},
  pages   = {303--310},
  year    = {2002},
  url     = {https://doi.org/10.25596/jalc-2002-303},
  doi     = {10.25596/jalc-2002-303}
}