On the public citation graph

Axiomatizing the equational theory of regular tree languages

https://doi.org/10.1007/bfb0028581
0 signed · 37 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.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1006/inco.1998.2746openalex-snapshot
Group Axioms for Iteration
inferredcites →https://doi.org/10.1007/3-540-10284-1openalex-snapshot
Algebraic semantics
inferredcites →https://doi.org/10.1007/3-540-10854-8_13openalex-snapshot
An axiomatization of regular forests in the language of algebraic theories with iteration
inferredcites →https://doi.org/10.1007/3-540-58338-6_58openalex-snapshot
Solving polynomial fixed point equations
inferredcites →https://doi.org/10.1007/3-540-61550-4_160openalex-snapshot
Equational properties of iteration in algebraically complete categories
inferredcites →https://doi.org/10.1007/978-3-642-78034-9_6openalex-snapshot
Iterative Theories
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/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bfb0048939openalex-snapshot
Definable operations in general algebras, and the theory of automata and flowcharts
inferredcites →https://doi.org/10.1016/0022-0000(83)90044-2openalex-snapshot
Algebras of iteration theories
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(91)90395-iopenalex-snapshot
Complete systems ofB-rational identities
inferredcites →https://doi.org/10.1016/0304-3975(95)00131-xopenalex-snapshot
An algebraic characterization of frontier testable tree languages
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/j.jlap.2009.10.001openalex-snapshot
Axiomatizing the equational theory of regular tree languages
inferredcites →https://doi.org/10.1016/s0304-3975(96)00240-xopenalex-snapshot
Completeness of Park induction
inferredcites →https://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot
The equational logic of fixed points
inferredcites →https://doi.org/10.1017/s0960129500000104openalex-snapshot
Equational axioms for regular sets
inferredcites →https://doi.org/10.1051/ita/1990240404191openalex-snapshot
Une remarque sur les systèmes complets d'identités rationnelles
inferredcites →https://doi.org/10.1142/2481openalex-snapshot
Finite Semigroups and Universal Algebra
inferredcites →https://doi.org/10.1142/s0129054192000164openalex-snapshot
ITERATION ALGEBRAS
inferredcites →https://doi.org/10.1142/s0129054193000249openalex-snapshot
ERRATUM: "ITERATION ALGEBRAS"
inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot
Two Complete Axiom Systems for the Algebra of Regular Events
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.2307/2586843openalex-snapshot
The logic of recursive equations

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11828563_27openalex-snapshot
Monodic Tree Kleene Algebra
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_3openalex-snapshot
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_10openalex-snapshot
A Kleene Theorem for Polynomial Coalgebras
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_15openalex-snapshot
Iteration Grove Theories with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_34openalex-snapshot
Simulations of Weighted Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_2openalex-snapshot
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.011openalex-snapshot
A Connection Between Concurrency and Language Theory
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.1017/s0960129518000361openalex-snapshot
Equational properties of fixed-point operations in cartesian categories: An overview
inferred← citeshttps://doi.org/10.1145/1227839.1227843openalex-snapshot
Logical definability and query languages over ranked and unranked trees
inferred← citeshttps://doi.org/10.14232/phd.2061openalex-snapshot
Partial iteration theories
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.