Cite
Simplification Problems for Deterministic Pushdown Automata on Infinite Words.
MLA
Löding, Christof. “Simplification Problems for Deterministic Pushdown Automata on Infinite Words.” International Journal of Foundations of Computer Science, vol. 26, no. 8, Dec. 2015, pp. 1041–68. EBSCOhost, https://doi.org/10.1142/S0129054115400122.
APA
Löding, C. (2015). Simplification Problems for Deterministic Pushdown Automata on Infinite Words. International Journal of Foundations of Computer Science, 26(8), 1041–1068. https://doi.org/10.1142/S0129054115400122
Chicago
Löding, Christof. 2015. “Simplification Problems for Deterministic Pushdown Automata on Infinite Words.” International Journal of Foundations of Computer Science 26 (8): 1041–68. doi:10.1142/S0129054115400122.