A new proof for the decidability of D0L ultimate periodicity

MLA

Vesa Halava, et al. “A New Proof for the Decidability of D0L Ultimate Periodicity.” Electronic Proceedings in Theoretical Computer Science, vol. 63, no. Proc. WORDS 2011, Aug. 2011, pp. 147–51. EBSCOhost, https://doi.org/10.4204/EPTCS.63.20.

APA

Vesa Halava, Tero Harju, & Tomi Kärki. (2011). A new proof for the decidability of D0L ultimate periodicity. Electronic Proceedings in Theoretical Computer Science, 63(Proc. WORDS 2011), 147–151. https://doi.org/10.4204/EPTCS.63.20

Chicago

Vesa Halava, Tero Harju, and Tomi Kärki. 2011. “A New Proof for the Decidability of D0L Ultimate Periodicity.” Electronic Proceedings in Theoretical Computer Science 63 (Proc. WORDS 2011): 147–51. doi:10.4204/EPTCS.63.20.