On the public citation graph

A Reiterman theorem for pseudovarieties of finite first-order structures

https://doi.org/10.1007/bf01243597
0 signed · 62 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-4613-8130-3openalex-snapshot
A Course in Universal Algebra
inferredcites →https://doi.org/10.1007/978-3-642-61284-8openalex-snapshot
Fundamentals of Algebraic Specification 2
inferredcites →https://doi.org/10.1007/978-3-642-76771-5openalex-snapshot
Universal Algebra for Computer Scientists
inferredcites →https://doi.org/10.1007/978-94-011-0149-3_3openalex-snapshot
Semigroups and Automata on Infinite Words
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/bf02483902openalex-snapshot
The Birkhoff theorem for finite algebras
inferredcites →https://doi.org/10.1007/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferredcites →https://doi.org/10.1016/s0022-0000(76)80030-xopenalex-snapshot
Varieties of ordered algebras
inferredcites →https://doi.org/10.1016/s0049-237x(08)71098-xopenalex-snapshot
Fundamentals of Model Theory
inferredcites →https://doi.org/10.1142/2481openalex-snapshot
Finite Semigroups and Universal Algebra
inferredcites →https://doi.org/10.1142/9789812831644openalex-snapshot
Finite Semigroups And Universal Algebra
inferredcites →https://doi.org/10.1142/s0218196793000287openalex-snapshot
AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
inferredcites →https://doi.org/10.2307/2322184openalex-snapshot
A Course in Universal Algebra.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jabr.1999.8265openalex-snapshot
Right Cancellative and Left Ample Monoids: Quasivarieties and Proper Covers
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_87openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_8openalex-snapshot
On Varieties of Ordered Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_23openalex-snapshot
Equational Axiomatization of Algebras with Structure
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_3openalex-snapshot
Seventy Years of Algebraic, Logical, and Topological Methods for Regular 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-540-85238-4_3openalex-snapshot
A Robust Class of Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_3openalex-snapshot
Theme and Variations on the Concatenation Product
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_10openalex-snapshot
Syntactic Semigroups
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/bf02679467openalex-snapshot
Polynomial closure and unambiguous product
inferred← citeshttps://doi.org/10.1007/bf03325434openalex-snapshot
Varieties and pseudovarieties of ordered normal bands
inferred← citeshttps://doi.org/10.1007/bfb0054312openalex-snapshot
Positive varieties and infinite words
inferred← citeshttps://doi.org/10.1007/s00025-019-0998-7openalex-snapshot
Pseudovarieties of Ordered Completely Regular Semigroups
inferred← citeshttps://doi.org/10.1007/s00233-021-10167-0openalex-snapshot
A topological shuttle between inequalities and pseudoinequalities
inferred← citeshttps://doi.org/10.1007/s00233-026-10611-zopenalex-snapshot
A purely algebraic proof of the omega-reducibility of pseudovarieties representing low half levels of concatenation hierarchies
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.09.011openalex-snapshot
A counterexample to a conjecture concerning concatenation hierarchies
inferred← citeshttps://doi.org/10.1016/j.jpaa.2006.06.016openalex-snapshot
Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts
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.tcs.2003.10.034openalex-snapshot
Shuffle on positive varieties of languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.09.017openalex-snapshot
Two algebraic approaches to variants of the concatenation product
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.020openalex-snapshot
Syntactic structures of regular languages
inferred← citeshttps://doi.org/10.1016/s0079-8169(04)80014-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00031-1openalex-snapshot
Series–parallel languages and the bounded-width property
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00230-4openalex-snapshot
Algebraic tools for the concatenation product
inferred← citeshttps://doi.org/10.1017/cbo9780511661877.009openalex-snapshot
Finite semigroups as categories, ordered semigroups or compact semigroups
inferred← citeshttps://doi.org/10.1051/ita:2001134openalex-snapshot
A conjecture on the concatenation product
inferred← citeshttps://doi.org/10.1051/ita:2005001openalex-snapshot
The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin
inferred← citeshttps://doi.org/10.1080/00927879808826163openalex-snapshot
Irreducibility of certain pseudovarieties1
inferred← citeshttps://doi.org/10.1081/agb-120006484openalex-snapshot
SEMIDIRECT PRODUCTS OF ORDERED SEMIGROUPS
inferred← citeshttps://doi.org/10.1090/tran/7951openalex-snapshot
Representations of relatively free profinite semigroups, irreducibility, and order primitivity
inferred← citeshttps://doi.org/10.1142/s0129054110007386openalex-snapshot
ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES
inferred← citeshttps://doi.org/10.1142/s0129054112400497openalex-snapshot
EQUATIONAL DESCRIPTIONS OF LANGUAGES
inferred← citeshttps://doi.org/10.1142/s0218196700000285openalex-snapshot
POLYNOMIAL CLOSURE AND TOPOLOGY
inferred← citeshttps://doi.org/10.1142/s0218196702000912openalex-snapshot
PROFINITE METHODS IN SEMIGROUP THEORY
inferred← citeshttps://doi.org/10.1142/s021819671540010xopenalex-snapshot
On fixed points of the lower set operator
inferred← citeshttps://doi.org/10.1142/s0218196716500648openalex-snapshot
Reducibility vs. definability for pseudovarieties of semigroups
inferred← citeshttps://doi.org/10.1142/s0218196724500024openalex-snapshot
The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies
inferred← citeshttps://doi.org/10.1145/3303991openalex-snapshot
Going Higher in First-Order Quantifier Alternation Hierarchies on Words
inferred← citeshttps://doi.org/10.1145/3464691openalex-snapshot
Reiterman’s Theorem on Finite Algebras for a Monad
inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.7openalex-snapshot
Commutative Positive Varieties of Languages
inferred← citeshttps://doi.org/10.1515/dema-2013-0341openalex-snapshot
Hyper-pseudoformulas and M-solid ordered pseudovarieties
inferred← citeshttps://doi.org/10.1515/forum-2016-0028openalex-snapshot
The ω-inequality problem for concatenation hierarchies of star-free languages
inferred← citeshttps://doi.org/10.4171/automataopenalex-snapshot
Handbook of Automata Theory
inferred← citeshttps://doi.org/10.4204/eptcs.151.3openalex-snapshot
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
inferred← citeshttps://doi.org/10.46298/dmtcs.490openalex-snapshot
New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages
inferred← citeshttps://doi.org/10.48550/arxiv.1812.02016openalex-snapshot
Equational Axiomatization of Algebras with Structure
inferred← citeshttps://doi.org/10.82308/31455openalex-snapshot
Applications of algebraic automata theory to quantum finite automata
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.