On the Decidability of MSO+U on Infinite Trees

MLA

Henryk Michalewski, et al. “On the Decidability of MSO+U on Infinite Trees.” Automata, Languages, and Programming, Jan. 2014. EBSCOhost, https://doi.org/10.1007/978-3-662-43951-7_5.

APA

Henryk Michalewski, Michał Skrzypczak, Tomasz Gogacz, & Mikołaj Bojańczyk. (2014). On the Decidability of MSO+U on Infinite Trees. Automata, Languages, and Programming. https://doi.org/10.1007/978-3-662-43951-7_5

Chicago

Henryk Michalewski, Michał Skrzypczak, Tomasz Gogacz, and Mikołaj Bojańczyk. 2014. “On the Decidability of MSO+U on Infinite Trees.” Automata, Languages, and Programming, January. doi:10.1007/978-3-662-43951-7_5.