A topological approach to recognition
DOI10.1007/978-3-642-14162-1_13zbMATH Open1288.68176OpenAlexW2144731472MaRDI QIDQ3587435FDOQ3587435
Authors: Mai Gehrke, Serge Grigorieff, Jean-Éric Pin
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_13
Recommendations
Algebraic theory of languages and automata (68Q70) Uniform structures and generalizations (54E15) Semigroups in automata theory, linguistics, etc. (20M35) Stone spaces (Boolean spaces) and related structures (06E15)
Cited In (21)
- Polyadic spaces and profinite monoids
- Uniform Birkhoff
- Quantifiers on languages and codensity monads
- Dual Space of a Lattice as the Completion of a Pervin Space
- Stone pseudovarieties
- Substitution Principle and semidirect products
- Distributive envelopes and topological duality for lattices via canonical extensions.
- 2-manifold recognition is in logspace
- Ultrafilters on words for a fragment of logic
- A topological approach to non-uniform complexity
- Stone duality, topological algebra, and recognition.
- Recognisable Languages over Monads
- Pervin spaces and Frith frames: bitopological aspects and completion
- What makes a Stone topological algebra profinite
- Title not available (Why is that?)
- Profinite topologies
- A topological approach to transductions
- Title not available (Why is that?)
- On recognition and compactification
- Uniform space
- Profinite techniques for probabilistic automata and the Markov monoid algorithm
This page was built for publication: A topological approach to recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587435)