Salomaa, Kai, et al. “Tight Lower Bound for the State Complexity of Shuffle of Regular Languages”. Journal of Automata, Languages and Combinatorics, vol. 7, no. 3, 2002, pp. 303-10, https://scholar2.islandarchives.ca/islandora/object/ir%3Air-batch6-1531.

Genre

  • Journal Article
Contributors
Author: Salomaa, Kai
Author: Campeanu, Cezar
Author: Yu, Sheng
Date Issued
2002

Language

  • English
Page range
303-310
Host Title
Journal of Automata, Languages and Combinatorics
Host Abbreviated Title
J.Autom.Lang.Comb.
Volume
7
Issue
3
ISSN
1430-189X

Department