Choose the citation style.
Campeanu, C., Salomaa, K., & Yu, S. (2002). Tight lower bound for the state complexity of shuffle of regular languages. Journal Of Automata, Languages And Combinatorics, 7(3), 303-310.

Bookmarks: