Pippenger, N. “Regular Languages and Stone Duality”. Theory of Computing Systems, vol. 30, no. 2, 1997, pp. 121-34, https://doi.org/10.1007/s002240000045.
Pippenger, N. (1997). Regular Languages and Stone Duality. Theory of Computing Systems, 30(2), 121-134. https://doi.org/10.1007/s002240000045
Pippenger, N. “Regular Languages and Stone Duality”. Theory of Computing Systems 30, no. 2 (1997): 121-34. https://doi.org/10.1007/s002240000045.
1.
Pippenger N. Regular Languages and Stone Duality. Theory of Computing Systems. 1997;30(2):121-34.