Regular languages and stone duality

Theory of Computing Systems

Volumn 30, Issue 2, 1997, Pages 121-134

  Pippenger, N ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; TOPOLOGY;

FIXED NUMBERS; SEMIGROUPS; STONE DUALITIES; STONE SPACES; TOPOLOGICAL SPACES;

BOOLEAN ALGEBRA;

EID: 0031081930     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679444     Document Type: Article

References (21)

1. J. Almeida, Equations for Pseudovarieties, in: J. E. Pin (ed.), Formal Properties of Finite Automata and Applications, Springer-Verlag, Berlin, 1989 (Lecture Notes in Computer Science, vol. 386).
2. J. Almeida, Equations for Pseudovarieties, in: J. E. Pin (ed.), Formal Properties of Finite Automata and Applications, Springer-Verlag, Berlin, 1989 (Lecture Notes in Computer Science, vol. 386).
3. J. Almeida, On Pseudovarieties, Varieties of Languages, Filters of Congruences, Pseudoidentities and Related Topics, Algebra Universalis, 27 (1990), 333-350.
4. J. Almeida and P. Weil, Relatively Free Profinite Monoids: An Introduction and Examples, in: J. Fountain and V. Gould (eds.), Kluwer, Dordrecht, 1995.
5. D. Beauquier and J.-E. Pin, Languages and Scanners, Theoret. Comput. Sci., 84 (1991), 3-21.
6. G. Birkhoff, On the Structure of Abstract Algebras, Math. Proc. Cambridge Philos. Soc., 31 (1935), 433-454.
7. S. Eilenberg, Classes of Semigroups and Classes of Sets, Proc. Fifth ACM Symp. on Theory of Computing, 1973, pp. 266-267.
8. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, 1974 (vol. A), 1976 (vol. B).
9. C. J. Everett, Closure Operations and Galois Theory in Lattices, Trans. Amer. Math. Soc., 55 (1944), 514-525.
10. M. Hall, Jr., A Topology for Free Groups and Related Groups, Ann. of Math., 52 (1950), 127-139.
11. P. R. Halmos, Lectures on Boolean Algebras, Van Nostrand, Princeton, NJ, 1963.
12. R. P. Hunter, Certain Finitely Generated Compact Zero-Dimensional Semigroups, J. Austral. Math. Soc. Ser. A, 44 (1988), 265-270.
13. R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, Cambridge MA, 1971.
14. K. Numakura, Theorems on Compact Totally Disconnected Semigroups and Lattices, Proc. Amer. Math. Soc., 8 (1957), 623-626.
15. Ø. Ore, Galois Connexions, Trans. Amer. Math. Soc., 55 (1944), 493-513.
16. M. O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM J. Res. Develop., 3 (1959), 14-125.
17. J. Reiterman, The Birkhoff Theorem for Finite Algebras, Algebra Universalis, 14 (1982), 1-10.
18. M. Schützenberger, On Finite Monoids Having Only Trivial Subgroups, Inform. and Control, 8 (1965), 190-194.
19. M. H. Stone, The Theory of Representations for Boolean Algebras, Trans. Amer. Math. Soc., 40 (1936), 37-111.
20. M. H. Stone, Applications of the Theory of Boolean Rings to General Topology, Trans. Amer. Math. Soc., 41 (1937), 375-481.
21. M. Ward, The Closure Operators of a Lattice, Ann. of Math., 43 (1942), 191-196.