On the public citation graph

Regular Languages and Stone Duality

https://doi.org/10.1007/bf02679444
0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-9855-7openalex-snapshot
Lectures on Boolean Algebras
inferredcites →https://doi.org/10.1007/978-94-011-0149-3_4openalex-snapshot
Relatively Free Profinite Monoids: An Introduction and Examples
inferredcites →https://doi.org/10.1007/bf01190713openalex-snapshot
On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
inferredcites →https://doi.org/10.1007/bf02483902openalex-snapshot
The Birkhoff theorem for finite algebras
inferredcites →https://doi.org/10.1007/bfb0013106openalex-snapshot
Formal Properties of Finite Automata and Applications
inferredcites →https://doi.org/10.1007/bfb0013118openalex-snapshot
Equations for pseudovarieties
inferredcites →https://doi.org/10.1016/0304-3975(91)90258-4openalex-snapshot
Languages and scanners
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1017/s1446788700029852openalex-snapshot
Certain Finitely Generated Compact Zero Dimensional Semigroups
inferredcites →https://doi.org/10.1090/s0002-9939-1957-0087032-5openalex-snapshot
Theorems on Compact Totally Disconnected Semigroups and Lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1936-1501865-8openalex-snapshot
The theory of representations for Boolean algebras
inferredcites →https://doi.org/10.1090/s0002-9947-1937-1501905-7openalex-snapshot
Applications of the theory of Boolean rings to general topology
inferredcites →https://doi.org/10.1090/s0002-9947-1944-0010555-7openalex-snapshot
Galois Connexions
inferredcites →https://doi.org/10.1090/s0002-9947-1944-0010556-9openalex-snapshot
Closure Operators and Galois Theory in Lattices
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/800125.804057openalex-snapshot
Classes of semigroups and classes of sets
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.2307/1968865openalex-snapshot
The Closure Operators of a Lattice
inferredcites →https://doi.org/10.2307/1969513openalex-snapshot
A Topology for Free Groups and Related Groups
inferredcites →https://doi.org/10.2307/1989664openalex-snapshot
The Theory of Representation for Boolean Algebras

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-55215-2_4openalex-snapshot
Free Profinite Monoids, Semigroups and Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_4openalex-snapshot
A Cook’s Tour of Duality in Logic: From Quantifiers, Through Vietoris, to Measures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_8openalex-snapshot
Monoidal Extended Stone Duality
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_22openalex-snapshot
Using Duality in Circuit Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_30openalex-snapshot
The Boolean Algebra of Piecewise Testable Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_21openalex-snapshot
Duality and Equational Theory of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-03741-2_17openalex-snapshot
Stone Duality and the Recognisable Languages over an Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_33openalex-snapshot
Boolean Algebras of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_3openalex-snapshot
Duality and Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_44openalex-snapshot
Boolean Algebras of Regular ω-Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_24openalex-snapshot
Generalized Eilenberg Theorem I: Local Varieties of Languages
inferred← citeshttps://doi.org/10.1007/978-981-99-6349-2_2openalex-snapshot
Non-commutative Stone Duality
inferred← citeshttps://doi.org/10.1007/s10469-014-9260-2openalex-snapshot
Boolean Algebras of Regular Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2015.08.001openalex-snapshot
The dual equivalence of equations and coequations for automata
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104443openalex-snapshot
A topological approach to non-uniform complexity
inferred← citeshttps://doi.org/10.1016/j.jpaa.2015.12.007openalex-snapshot
Stone duality, topological algebra, and recognition
inferred← citeshttps://doi.org/10.1016/j.jpaa.2021.106755openalex-snapshot
A categorical duality for algebras of partial functions
inferred← citeshttps://doi.org/10.1016/j.jpaa.2025.107863openalex-snapshot
Semi-galois Categories I: The classical Eilenberg variety theory
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00120-3openalex-snapshot
On syntactic nuclei of rational languages
inferred← citeshttps://doi.org/10.1017/s0960129521000074openalex-snapshot
Quantifiers on languages and codensity monads
inferred← citeshttps://doi.org/10.1017/s0960129523000294openalex-snapshot
Substitution Principle and semidirect products
inferred← citeshttps://doi.org/10.1089/vbz.2020.2730openalex-snapshot
Spatial Distribution of Bat Shelters and Livestock Rabies in Southern Brazil
inferred← citeshttps://doi.org/10.1109/lics.2015.46openalex-snapshot
Varieties of Languages in a Category
inferred← citeshttps://doi.org/10.1109/lics.2017.8005140openalex-snapshot
Quantifiers on languages and codensity monads
inferred← citeshttps://doi.org/10.1142/s0129054112400497openalex-snapshot
EQUATIONAL DESCRIPTIONS OF LANGUAGES
inferred← citeshttps://doi.org/10.1145/2933575.2934575openalex-snapshot
Duality in Computer Science
inferred← citeshttps://doi.org/10.1145/3090064.3090068openalex-snapshot
Stone duality for languages and complexity
inferred← citeshttps://doi.org/10.1145/3276771openalex-snapshot
Generalized Eilenberg Theorem
inferred← citeshttps://doi.org/10.4230/lipics.calco.2015.50openalex-snapshot
A Fibrational Approach to Automata Theory
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1856openalex-snapshot
Profinite Methods in Automata Theory
inferred← citeshttps://doi.org/10.46298/entics.12280openalex-snapshot
Profinite lambda-terms and parametricity
inferred← citeshttps://doi.org/10.48550/arxiv.1510.04849openalex-snapshot
Using Duality in Circuit Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1512.04389openalex-snapshot
Semi-galois Categories I: The Classical Eilenberg Variety Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1910.07583openalex-snapshot
Abstract Transducers
inferred← citeshttps://doi.org/10.5555/3329995.3330075openalex-snapshot
Quantifiers on languages and codensity monads
inferred← citeshttps://doi.org/10.5565/publmat6712303openalex-snapshot
Locally countable pseudovarieties
inferred← citeshttps://doi.org/10.7561/sacs.2015.2openalex-snapshot
inferred← citeshttps://doi.org/10.7561/sacs.2015.2.171openalex-snapshot
Formations of Monoids, Congruences, and Formal Languages
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.