Abstract
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it applies to any Boolean algebra (BA) of subsets rather than to individual subsets. Thirdly, topology is the key ingredient. We prove the existence of a minimum recognizer in a very general setting which applies in particular to any BA of subsets of a discrete space. Our main results show that this minimum recognizer is a uniform space whose completion is the dual of the original BA in Stone-Priestley duality; in the case of a BA of languages closed under quotients, this completion, called the syntactic space of the BA, is a compact monoid if and only if all the languages of the BA are regular. For regular languages, one recovers the notions of a syntactic monoid and of a free profinite monoid. For nonregular languages, the syntactic space is no longer a monoid but is still a compact space. Further, we give an equational characterization of BA of languages closed under quotients, which extends the known results on regular languages to nonregular languages. Finally, we generalize all these results from BAs to lattices, in which case the appropriate structures are partially ordered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almeida, J.: Profinite semigroups and applications, in Structural theory of automata, semigroups, and universal algebra. The Analysis of Concurrent Systems 207, 1–45 (2005)
Barrington, D.A.M., Compton, K., Straubing, H., Thérien, D.: Regular languages in \({\rm NC}\sp 1\). J. Comput. System Sci. 44(3), 478–499 (1992)
Bloom, S.L., Ésik, Z.: A Mezei-Wright theorem for categorical algebras. Theoret. Comput. Sci. 411(2), 341–359 (2010)
Bourbaki, N.: General topology. Elements of Mathematics (Berlin), ch. 1-4. Springer, Berlin (1998)
Clark, D.M., Davey, B.A., Freese, R.S., Jackson, M.: Standard topological algebras: syntactic and principal congruences and profiniteness. Algebra Universalis 52(2-3), 343–376 (2004)
Gehrke, M., Grigorieff, S., Pin, J.-E.: Duality and equational theory of regular languages. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246–257. Springer, Heidelberg (2008)
Hindman, N., Strauss, D.: Algebra in the Stone-Čech compactification, de Gruyter Expositions in Mathematics, vol. 27. Walter De Gruyter & Co., Berlin (1998) Theory and applications
Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. J. Comput. System Sci. 26(3), 295–310 (1983)
Perrin, D., Pin, J.-E.: Infinite Words, Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)
Pervin, W.J.: Quasi-uniformization of topological spaces. Math. Ann. 147, 316–317 (1962)
Pin, J.-E.: A variety theorem without complementation. Russian Mathematics (Iz. VUZ) 39, 80–90 (1995)
Pin, J.-E., Weil, P.: Uniformities on free semigroups. International Journal of Algebra and Computation 9, 431–453 (1999)
Priestley, H.A.: Representation of distributive lattices by means of ordered Stone spaces. Bull London Math. Soc. 2, 186–190 (1970)
Sakarovitch, J.: An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. In: Mazurkiewicz, A.W. (ed.) MFCS 1976. LNCS, vol. 45, pp. 510–516. Springer, Heidelberg (1976)
Straubing, H.: Finite automata, formal logic, and circuit complexity, Progress in Theoretical Computer Science. Birkhäuser Boston Inc, Boston (1994)
Thomas, W.: Uniform and nonuniform recognizability. Theoret. Comput. Sci. 292(1), 299–316 (2003); Selected papers in honor of Jean Berstel
Wilke, T.: An algebraic theory for regular languages of finite and infinite words. Int. J. Alg. Comput. 3, 447–489 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gehrke, M., Grigorieff, S., Pin, JÉ. (2010). A Topological Approach to Recognition. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-14162-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14161-4
Online ISBN: 978-3-642-14162-1
eBook Packages: Computer ScienceComputer Science (R0)