Choose the citation style.
Campeanu, C., & Paun, A. (2005). Tight bounds for NFA to DFCA transformations for binary alphabets. In Implementation and application of automata (pp. 306-307). Springer Verlag.

Bookmarks: