On the public citation graph
On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
0 signed · 53 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-8130-3openalex-snapshot
A Course in Universal Algebra
inferredcites →https://doi.org/10.1007/bf01194543openalex-snapshot
The Birkhoff Theorem for varieties of finite algebras
inferredcites →https://doi.org/10.1007/bf01243870openalex-snapshot
The algebra of implicit operations
inferredcites →https://doi.org/10.1007/bf02483902openalex-snapshot
The Birkhoff theorem for finite algebras
inferredcites →https://doi.org/10.1007/bf02573192openalex-snapshot
The lattices of varieties and pseudovarieties of band monoids
inferredcites →https://doi.org/10.1016/0021-8693(85)90147-4openalex-snapshot
Pseudovarieties, generalized varieties and similarly described classes
inferredcites →https://doi.org/10.4153/cjm-1986-002-xopenalex-snapshot
Some Order Properties of the Lattice of Varieties of Commutative Semigroups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-3817-8_13openalex-snapshot
Algebraic classifications of regular tree languages
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_85openalex-snapshot
Algebras for classifying regular tree languages and an application to frontier testability
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_62openalex-snapshot
Classifying regular languages by their syntactic algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_17openalex-snapshot
On Logically Defined Recognizable Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_60openalex-snapshot
A Completeness Property of Wilke’s Tree Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-75414-5_12openalex-snapshot
Aperiodicity in Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_31openalex-snapshot
Profinite Monads, Profinite Equations, and Reiterman’s Theorem
inferred← citeshttps://doi.org/10.1007/bf00750161openalex-snapshot
Structure of lattices of varieties and lattices of quasivarieties: Similarity and difference. I
inferred← citeshttps://doi.org/10.1007/bf01225473openalex-snapshot
Nonstandard characterization of pseudovarieties
inferred← citeshttps://doi.org/10.1007/bf02573532openalex-snapshot
The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups
inferred← citeshttps://doi.org/10.1007/bf02573549openalex-snapshot
A unified syntactical approach to theorems of Putcha, Margolis, and Straubing on finite power semigroups
inferred← citeshttps://doi.org/10.1007/bf02574101openalex-snapshot
The joint of the pseudovarieties of idempotent semigroups and locally trivial semigroups
inferred← citeshttps://doi.org/10.1007/bf02679444openalex-snapshot
Regular Languages and Stone Duality
inferred← citeshttps://doi.org/10.1007/bfb0028581openalex-snapshot
Axiomatizing the equational theory of regular tree languages
inferred← citeshttps://doi.org/10.1007/s00012-005-1912-6openalex-snapshot
Congruence preserving functions of Wilke’s tree algebras
inferred← citeshttps://doi.org/10.1007/s11202-999-0015-6openalex-snapshot
On nonstandard axiomatization of elementarily nonaxiomatizable classes of discrete algebraic systems
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90124-2openalex-snapshot
Semidirect products of pseudovarieties from the universal algebraist's point of view
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90125-4openalex-snapshot
The join of the pseudovarieties of R-trivial and L-trivial monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00131-xopenalex-snapshot
An algebraic characterization of frontier testable tree languages
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.10.001openalex-snapshot
Axiomatizing the equational theory of regular tree languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.054openalex-snapshot
Unary algebras, semigroups and congruences on free semigroups
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.038openalex-snapshot
Algebraic recognizability of regular tree languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.026openalex-snapshot
Positive varieties of tree languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.034openalex-snapshot
Characterizing CTL-like logics on finite trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.006openalex-snapshot
Tree algebras and varieties of tree languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.018openalex-snapshot
Varieties of recognizable tree series over fields
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00119-9openalex-snapshot
Languages recognized by finite aperiodic groupoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00010-3openalex-snapshot
General varieties of tree languages
inferred← citeshttps://doi.org/10.1017/s0004972700036492openalex-snapshot
Theorems of Birkhoff type in pseudovarieties and e-varieties of regular semigroups
inferred← citeshttps://doi.org/10.1017/s0013091500007112openalex-snapshot
On finite simple semigroups
inferred← citeshttps://doi.org/10.1051/ita:1999105openalex-snapshot
Strongly locally testable semigroups with commuting idempotents and related languages
inferred← citeshttps://doi.org/10.1093/logcom/exz032openalex-snapshot
Congruence-based proofs of the recognizability theorems for free many-sorted algebras
inferred← citeshttps://doi.org/10.1142/s0218196710005595openalex-snapshot
ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
inferred← citeshttps://doi.org/10.1142/s1005386706000447openalex-snapshot
On Correspondences Between Unary Algebras, Automata, Semigroups and Congruences
inferred← citeshttps://doi.org/10.1142/s179355711100006xopenalex-snapshot
GENERALIZED CONTEXTS AND n-ARY SYNTACTIC SEMIGROUPS OF TREE LANGUAGES
inferred← citeshttps://doi.org/10.2307/421198openalex-snapshot
1995 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3233/fun-2008-821-205openalex-snapshot
Products of Tree Automata with an Application to Temporal Logic
inferred← citeshttps://doi.org/10.3233/fun-2008-821-206openalex-snapshot
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1510.07402openalex-snapshot
Varieties of Unranked Tree Languages
inferred← citeshttps://doi.org/10.7151/dmgaa.1189openalex-snapshot
On the solidity of general varieties of tree languages
inferred← citeshttps://doi.org/10.7151/dmgaa.1259openalex-snapshot
Varieties of regular algebras and unranked tree 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.