APA (7th ed.) Citation

Maler, O., & Pnueli, A. (1990). Tight bounds on the complexity of cascaded decomposition of automata. Foundations of Computer Science, 31st Symposium, 672-682 vol.2. https://doi.org/10.1109/FSCS.1990.89589

Chicago Style (17th ed.) Citation

Maler, O., and A. Pnueli. "Tight Bounds on the Complexity of Cascaded Decomposition of Automata." Foundations of Computer Science, 31st Symposium 1990: 672-682 vol.2. https://doi.org/10.1109/FSCS.1990.89589.

MLA (9th ed.) Citation

Maler, O., and A. Pnueli. "Tight Bounds on the Complexity of Cascaded Decomposition of Automata." Foundations of Computer Science, 31st Symposium, 1990, pp. 672-682 vol.2, https://doi.org/10.1109/FSCS.1990.89589.