Lohrey, M., & Ondrusch, N. (2005). Inverse Monoids: Decidability and Complexity of Algebraic Questions. Lecture notes in computer science, 664-675. https://doi.org/10.1007/11549345_57
Chicago Style (17th ed.) CitationLohrey, Markus, and Nicole Ondrusch. "Inverse Monoids: Decidability and Complexity of Algebraic Questions." Lecture Notes in Computer Science 2005: 664-675. https://doi.org/10.1007/11549345_57.
MLA (9th ed.) CitationLohrey, Markus, and Nicole Ondrusch. "Inverse Monoids: Decidability and Complexity of Algebraic Questions." Lecture Notes in Computer Science, 2005, pp. 664-675, https://doi.org/10.1007/11549345_57.
Warning: These citations may not always be 100% accurate.