On the public citation graph

Automata and coinduction (an exercise in coalgebra)

https://doi.org/10.1007/bfb0055624
0 signed · 171 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.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-56596-5_45openalex-snapshot
On the foundations of final semantics: Non-standard sets, metric spaces, partial orders
inferredcites →https://doi.org/10.1007/978-1-4612-1844-9openalex-snapshot
Automata and Computability
inferredcites →https://doi.org/10.1007/978-3-642-61611-2openalex-snapshot
Products of Automata
inferredcites →https://doi.org/10.1007/bf01843493openalex-snapshot
Realization is universal
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0018361openalex-snapshot
A final coalgebra theorem
inferredcites →https://doi.org/10.1016/0304-3975(86)90088-5openalex-snapshot
From regular expressions to deterministic automata
inferredcites →https://doi.org/10.1016/0890-5401(91)90036-2openalex-snapshot
Comparative semantics for flow of control in logic programming without logic
inferredcites →https://doi.org/10.1016/b978-1-4832-0013-2.50009-6openalex-snapshot
Coverings of Automata
inferredcites →https://doi.org/10.1016/c2013-0-08098-xopenalex-snapshot
Algebraic Theory of Automata
inferredcites →https://doi.org/10.1016/s0304-3975(00)00056-6openalex-snapshot
Universal coalgebra: a theory of systems
inferredcites →https://doi.org/10.1016/s0304-3975(97)00233-8openalex-snapshot
Duality for modal μ-logics
inferredcites →https://doi.org/10.1016/s0304-3975(97)00251-xopenalex-snapshot
Terminal metric spaces of finitely branching and image finite linear processes
inferredcites →https://doi.org/10.1016/s0898-1221(97)82940-9openalex-snapshot
Vicious circles: On the mathematics of non-wellfounded phenomena
inferredcites →https://doi.org/10.1016/s1571-0661(05)80564-xopenalex-snapshot
Preface
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0135681-9openalex-snapshot
Linear Automaton Transformations
inferredcites →https://doi.org/10.1145/321239.321249openalex-snapshot
Derivatives of Regular Expressions
inferredcites →https://doi.org/10.1145/321312.321326openalex-snapshot
Two Complete Axiom Systems for the Algebra of Regular Events
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.6100/ir444299openalex-snapshot
Taxonomies and toolkits of regular language algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470522622openalex-snapshot
UML 2 Semantics and Applications
inferred← citeshttps://doi.org/10.1002/9780470522622.ch10openalex-snapshot
Co‐Algebraic Semantic Framework for Reasoning about Interaction Designs
inferred← citeshttps://doi.org/10.1007/10722010_7openalex-snapshot
Regular Expressions Revisited: A Coinductive Approach to Streams, Automata, and Power Series
inferred← citeshttps://doi.org/10.1007/11548133_12openalex-snapshot
Using Proofs by Coinduction to Find “Traditional” Proofs
inferred← citeshttps://doi.org/10.1007/11548133_23openalex-snapshot
Final Semantics for Event-Pattern Reactive Programs
inferred← citeshttps://doi.org/10.1007/11556985_3openalex-snapshot
Computation of Partial Automata Through Span Composition
inferred← citeshttps://doi.org/10.1007/11562436_39openalex-snapshot
Expressive Completeness of an Event-Pattern Reactive Programming Language
inferred← citeshttps://doi.org/10.1007/11780274_20openalex-snapshot
A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_61openalex-snapshot
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-34733-2_7openalex-snapshot
Towards Distributed Reasoning for Behavioral Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-4493-7_2openalex-snapshot
Coalgebra, Concurrency, and Control
inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_4openalex-snapshot
Coalgebra Learning via Duality
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_15openalex-snapshot
Semantic Foundations for Deterministic Dataflow and Stream Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_6openalex-snapshot
Combining Semilattices and Semimodules
inferred← citeshttps://doi.org/10.1007/978-3-031-10736-8_3openalex-snapshot
Coalgebraic Semantics for Nominal Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_6openalex-snapshot
A Modified Completeness Theorem of KAT and Decidability of Term Reducibility
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_20openalex-snapshot
Automata Learning: A Categorical Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_4openalex-snapshot
Unified Classical Logic Completeness
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_29openalex-snapshot
Unified Decision Procedures for Regular Expression Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_1openalex-snapshot
NetKAT — A Formal System for the Verification of Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-40370-0_8openalex-snapshot
Product Rules and Distributive Laws
inferred← citeshttps://doi.org/10.1007/978-3-319-47843-2_15openalex-snapshot
On the Coalgebraic Theory of Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_1openalex-snapshot
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_13openalex-snapshot
On Equivalence Checking of Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-39656-7_2openalex-snapshot
Abstract Behavior Types: A Foundation Model for Components and Their Composition
inferred← citeshttps://doi.org/10.1007/978-3-540-40020-2_18openalex-snapshot
Notions of Behaviour and Reachable-Part and Their Institutions
inferred← citeshttps://doi.org/10.1007/978-3-540-71998-4_10openalex-snapshot
A (Co)Algebraic Analysis of Synchronization in CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_33openalex-snapshot
The Reaction Algebra: A Formal Language for Event Correlation
inferred← citeshttps://doi.org/10.1007/978-3-540-79299-4_1openalex-snapshot
Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-88914-4_16openalex-snapshot
Lax Invariant in Coalgebra
inferred← citeshttps://doi.org/10.1007/978-3-540-92687-0_31openalex-snapshot
A Bialgebraic Approach to Automata and Formal 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-03741-2_8openalex-snapshot
Characterising Behavioural Equivalence: Three Sides of One Coin
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_13openalex-snapshot
An Efficient Coq Tactic for Deciding Kleene Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_20openalex-snapshot
On Probabilistic Kleene Algebras, Automata and Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_2openalex-snapshot
From Grammars and Automata to Algebras and Coalgebras
inferred← citeshttps://doi.org/10.1007/978-3-642-22944-2_25openalex-snapshot
Context-Free Languages, Coalgebraically
inferred← citeshttps://doi.org/10.1007/978-3-642-28641-4_18openalex-snapshot
Towards Incrementalization of Holistic Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_10openalex-snapshot
On the Final Coalgebra of Automatic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_6openalex-snapshot
Stream Automata Are Coalgebras
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_11openalex-snapshot
Left-Handed Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_7openalex-snapshot
Deciding Regular Expressions (In-)Equivalence in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-34210-3_9openalex-snapshot
Coinductive Unwinding of Security-Relevant Hyperproperties
inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_32openalex-snapshot
Coalgebraic Bisimulation-Up-To
inferred← citeshttps://doi.org/10.1007/978-3-642-36642-0_16openalex-snapshot
Functional Stream Derivatives of Context-Awareness on P2P Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_42openalex-snapshot
Coinductive Proof Techniques for Language Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-642-40206-7_20openalex-snapshot
A Coalgebraic View of ε-Transitions
inferred← citeshttps://doi.org/10.1007/978-3-642-41488-6_17openalex-snapshot
Incremental Hyperproperty Model Checking via Games
inferred← citeshttps://doi.org/10.1007/978-3-662-01069-3_39openalex-snapshot
Modal Logic for Coalgebras
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_7openalex-snapshot
A New Foundation for Finitary Corecursion
inferred← citeshttps://doi.org/10.1007/978-3-662-53042-9_2openalex-snapshot
Types from Frames as Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_5openalex-snapshot
Friends with Benefits
inferred← citeshttps://doi.org/10.1007/s10485-007-9116-1openalex-snapshot
On Minimal Coalgebras
inferred← citeshttps://doi.org/10.1007/s10626-005-2868-6openalex-snapshot
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
inferred← citeshttps://doi.org/10.1007/s10699-016-9492-9openalex-snapshot
The Future of Mathematics in Economics: A Philosophically Grounded Proposal
inferred← citeshttps://doi.org/10.1007/s10817-011-9223-4openalex-snapshot
Proof Pearl: Regular Expression Equivalence and Relation Algebra
inferred← citeshttps://doi.org/10.1007/s10817-016-9391-3openalex-snapshot
Soundness and Completeness Proofs by Coinductive Methods
inferred← citeshttps://doi.org/10.1007/s11036-012-0404-0openalex-snapshot
Coalgebraic Aspects of Context-Awareness
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.019openalex-snapshot
A bialgebraic approach to automata and formal language theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.038openalex-snapshot
Automata and Fixed Point Logics for Coalgebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.042openalex-snapshot
On Equivalences for a Class of Timed Regular Expressions
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.022openalex-snapshot
Coalgebraising Subsequential Transducers
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.097openalex-snapshot
Equational Coalgebraic Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.014openalex-snapshot
A Single Complete Relational Rule for Coalgebraic Refinement
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.07.013openalex-snapshot
On Coalgebras over Algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.09.025openalex-snapshot
Ramified Corecurrence and Logspace
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.005openalex-snapshot
Varieties and Covarieties of Languages (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.021openalex-snapshot
Linearization of Automatic Arrays and Weave Specifications
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.03.017openalex-snapshot
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata
inferred← citeshttps://doi.org/10.1016/j.fss.2011.07.003openalex-snapshot
Bisimulations for fuzzy automata
inferred← citeshttps://doi.org/10.1016/j.ic.2005.06.003openalex-snapshot
Automata and fixed point logic: A coalgebraic perspective
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.008openalex-snapshot
Subsequential transducers: a coalgebraic perspective
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.2015.11.009openalex-snapshot
Proving language inclusion and equivalence by coinduction
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104456openalex-snapshot
A new foundation for finitary corecursion and iterative algebras
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105333openalex-snapshot
Relations between equation automata and follow automata
inferred← citeshttps://doi.org/10.1016/j.ins.2013.07.029openalex-snapshot
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.004openalex-snapshot
Context-free coalgebras
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.12.004openalex-snapshot
Deciding Kleene algebra terms equivalence in Coq
inferred← citeshttps://doi.org/10.1016/j.jocs.2021.101387openalex-snapshot
EB-DEVS: A formal framework for modeling and simulation of emergent behavior in dynamic complex systems
inferred← citeshttps://doi.org/10.1016/j.scico.2004.05.010openalex-snapshot
Abstract Behavior Types: a foundation model for components and their composition
inferred← citeshttps://doi.org/10.1016/j.scico.2014.12.006openalex-snapshot
Shape analysis in a functional language by using regular languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.020openalex-snapshot
A coalgebraic approach to Kleene algebra with tests
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.072openalex-snapshot
Components as coalgebras: The refinement dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.021openalex-snapshot
On coalgebras over algebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.027openalex-snapshot
Modalities in the Stone age: A comparison of coalgebraic logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.018openalex-snapshot
A description based on languages of the final non-deterministic automaton
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.040openalex-snapshot
Left-handed completeness
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00056-6openalex-snapshot
Universal coalgebra: a theory of systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00121-3openalex-snapshot
A Coalgebraic presentation of structured transition systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00019-6openalex-snapshot
CSP, partial automata, and coalgebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00582-0openalex-snapshot
Distributivity of categories of coalgebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00895-2openalex-snapshot
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80009-7openalex-snapshot
6 Algebras and coalgebras
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80022-xopenalex-snapshot
19 Applications of modal logic in linguistics
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80634-0openalex-snapshot
A Coalgebraic Approach to Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80637-6openalex-snapshot
Coinduction in Control of Partially Observed Discrete-Event Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80903-4openalex-snapshot
Generalised Coinduction
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80972-1openalex-snapshot
Elements of Stream Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81051-xopenalex-snapshot
Generating Optimal Monitors for Extended Regular Expressions
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80269-5openalex-snapshot
A coalgebraic introduction to CSP
inferred← citeshttps://doi.org/10.1017/s0956796815000246openalex-snapshot
Verified decision procedures for MSO on words based on derivatives of regular expressions
inferred← citeshttps://doi.org/10.1017/s0960129504004517openalex-snapshot
A coinductive calculus of streams
inferred← citeshttps://doi.org/10.1051/ita/2009015openalex-snapshot
Two extensions of system F with (co)iteration and primitive (co)recursion principles
inferred← citeshttps://doi.org/10.1051/ita:1999125openalex-snapshot
A note on Coinduction and Weak Bisimilarity for While Programs
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619045openalex-snapshot
Efficient Synthesis of Edit Functions for Opacity Enforcement Using Bisimulation-Based Abstractions
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00047openalex-snapshot
Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL
inferred← citeshttps://doi.org/10.1109/icra.2018.8460507openalex-snapshot
On the Relationship Between Bisimulation and Combinatorial Filter Reduction
inferred← citeshttps://doi.org/10.1109/tac.2007.915164openalex-snapshot
Modular Control of Discrete-Event Systems With Coalgebra
inferred← citeshttps://doi.org/10.1109/tac.2019.2946165openalex-snapshot
Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement
inferred← citeshttps://doi.org/10.1109/tase.2007.2openalex-snapshot
A Formal Approach to Aspect-Oriented Modular Reconfigurable Computing
inferred← citeshttps://doi.org/10.1109/tro.2021.3070967openalex-snapshot
Equivalence Notions for State-Space Minimization of Combinatorial Filters
inferred← citeshttps://doi.org/10.1145/1140612.1140627openalex-snapshot
SIGACT news logic column 15
inferred← citeshttps://doi.org/10.1145/1140612.1140628openalex-snapshot
Coalgebras and their logics
inferred← citeshttps://doi.org/10.1145/1863543.1863585openalex-snapshot
Total parser combinators
inferred← citeshttps://doi.org/10.1145/1925844.1926429openalex-snapshot
Regular expression containment
inferred← citeshttps://doi.org/10.1145/1926385.1926429openalex-snapshot
Regular expression containment
inferred← citeshttps://doi.org/10.1145/2103776.2103784openalex-snapshot
Reflexive toolbox for regular expression matching
inferred← citeshttps://doi.org/10.1145/2429069.2429124openalex-snapshot
Checking NFA equivalence with bisimulations up to congruence
inferred← citeshttps://doi.org/10.1145/2480359.2429124openalex-snapshot
Checking NFA equivalence with bisimulations up to congruence
inferred← citeshttps://doi.org/10.1145/2500365.2500612openalex-snapshot
Verified decision procedures for MSO on words based on derivatives of regular expressions
inferred← citeshttps://doi.org/10.1145/2676726.2677011openalex-snapshot
A Coalgebraic Decision Procedure for NetKAT
inferred← citeshttps://doi.org/10.1145/2713167openalex-snapshot
Hacking nondeterminism with induction and coinduction
inferred← citeshttps://doi.org/10.1145/2983990.2984026openalex-snapshot
Parsing with first-class derivatives
inferred← citeshttps://doi.org/10.1145/3022671.2984026openalex-snapshot
Parsing with first-class derivatives
inferred← citeshttps://doi.org/10.1145/384169.384173openalex-snapshot
Dynamic structures in modeling and simulation
inferred← citeshttps://doi.org/10.2168/lmcs-6(3:23)2010openalex-snapshot
Non-Deterministic Kleene Coalgebras
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:16)2012openalex-snapshot
Deciding Kleene Algebras in Coq
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:14)2013openalex-snapshot
Coalgebraic Characterizations of Context-Free Languages
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:28)2017openalex-snapshot
Formal Languages, Formally and Coinductively
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:22)2018openalex-snapshot
Proper Functors and Fixed Points for Finite Behaviour
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:14)2019openalex-snapshot
Companions, Causality and Codensity
inferred← citeshttps://doi.org/10.25949/19430699openalex-snapshot
Algebraic verification of probabilistic and concurrent systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cc9openalex-snapshot
Combining Semilattices and Semimodules
inferred← citeshttps://doi.org/10.3390/math9030272openalex-snapshot
Fuzzy Automata as Coalgebras
inferred← citeshttps://doi.org/10.4204/eptcs.158.3openalex-snapshot
Coalgebraic Quantum Computation
inferred← citeshttps://doi.org/10.4204/eptcs.351.15openalex-snapshot
On Star Expressions and Completeness Theorems
inferred← citeshttps://doi.org/10.4204/eptcs.96.10openalex-snapshot
Deciding KAT and Hoare Logic with Derivatives
inferred← citeshttps://doi.org/10.4216/jpssj.36.2_65openalex-snapshot
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:17)2023openalex-snapshot
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
inferred← citeshttps://doi.org/10.48550/arxiv.0807.4553openalex-snapshot
A Bialgebraic Approach to Automata and Formal Language Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02910openalex-snapshot
Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1902.05762openalex-snapshot
Coalgebra Learning via Duality
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0405097openalex-snapshot
A Coalgebraic Approach to Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0605128openalex-snapshot
Logic Column 15: Coalgebras and Their Logics
inferred← citeshttps://doi.org/10.5281/zenodo.12705522openalex-snapshot
Homomorphism between AOMRC and Hoare Model of Deterministic Reconfiguration Processes in Reconfigurable Computing Systems
inferred← citeshttps://doi.org/10.70675/bae6e60bz6d6ez4e30z81e4z3dfa94433bfcopenalex-snapshot
On the compositionality of monads via weak distributive laws
inferred← citeshttps://doi.org/10.7561/sacs.2012.2.367openalex-snapshot
Position Automata for Kleene Algebra with Tests
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.