On the public citation graph

Algebra-coalgebra duality in brzozowski's minimization algorithm

0 signed · 78 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/0-387-21734-7_4openalex-snapshot

Fourier Analysis on Groups

inferredcites →https://doi.org/10.1007/11591191_28openalex-snapshot

Experimental Evaluation of Classical Automata Constructions

inferredcites →https://doi.org/10.1007/3-540-45315-6_5openalex-snapshot

On the Duality between Observability and Reachability

inferredcites →https://doi.org/10.1007/978-3-319-47843-2_15openalex-snapshot

On the Coalgebraic Theory of Kleene Algebra with Tests

inferredcites →https://doi.org/10.1007/978-3-540-70583-3_21openalex-snapshot

Duality and Equational Theory of Regular Languages

inferredcites →https://doi.org/10.1007/978-3-642-03741-2_17openalex-snapshot

Stone Duality and the Recognisable Languages over an Algebra

inferredcites →https://doi.org/10.1007/978-3-642-22256-6_9openalex-snapshot

Nondeterministic Moore Automata and Brzozowski’s Algorithm

inferredcites →https://doi.org/10.1007/978-3-642-28729-9openalex-snapshot

Foundations of software science and computational structures : 15th International Conference, FOSSACS 2012, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24-April 1, 2012. Proceedings

inferredcites →https://doi.org/10.1007/978-3-642-28729-9_4openalex-snapshot

A Coalgebraic Perspective on Minimization and Determinization

inferredcites →https://doi.org/10.1007/978-3-642-28729-9_6openalex-snapshot

Well-Pointed Coalgebras (Extended Abstract)

inferredcites →https://doi.org/10.1007/978-3-642-29485-3_2openalex-snapshot

Brzozowski’s Algorithm (Co)Algebraically

inferredcites →https://doi.org/10.1007/978-3-642-32621-9_14openalex-snapshot

Minimization via Duality

inferredcites →https://doi.org/10.1016/0005-1098(69)90026-0openalex-snapshot

On the relevance of abstract algebra to control theory

inferredcites →https://doi.org/10.1016/0022-0000(80)90012-4openalex-snapshot

Foundations of system theory: The hankel matrix

inferredcites →https://doi.org/10.1016/0022-4049(75)90028-6openalex-snapshot

Adjoint machines, state-behavior machines, and duality

inferredcites →https://doi.org/10.1016/0022-4049(80)90090-0openalex-snapshot

Machines in a category

inferredcites →https://doi.org/10.1016/j.ic.2011.12.002openalex-snapshot

A coalgebraic perspective on linear weighted automata

inferredcites →https://doi.org/10.1016/s0019-9958(61)80020-xopenalex-snapshot

On the definition of a family of automata

inferredcites →https://doi.org/10.1016/s0019-9958(63)90290-0openalex-snapshot

Probabilistic 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/s1474-6670(17)70094-8openalex-snapshot

On the general theory of control systems

inferredcites →https://doi.org/10.1017/cbo9781139195218openalex-snapshot

Elements of Automata Theory

inferredcites →https://doi.org/10.1017/s0004972700024412openalex-snapshot

Fuzzy machines in a category

inferredcites →https://doi.org/10.1080/00029890.1975.11993918openalex-snapshot

Extensions of Semilattices

inferredcites →https://doi.org/10.1090/s0002-9904-1972-13032-5openalex-snapshot

Minimal realization of machines in closed categories

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/tac.1959.1104873openalex-snapshot

On the general theory of control systems

inferredcites →https://doi.org/10.1137/1016026openalex-snapshot

Machines in a Category: An Expository Introduction

inferredcites →https://doi.org/10.1142/s0129054111009070openalex-snapshot

THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA

inferredcites →https://doi.org/10.1145/2422085.2422092openalex-snapshot

Sound and Complete Axiomatizations of Coalgebraic Language Equivalence

inferredcites →https://doi.org/10.1145/256167.256195openalex-snapshot

Kleene algebra with tests

inferredcites →https://doi.org/10.1201/9781420037586.axbopenalex-snapshot

Fourier Analysis on Groups

inferredcites →https://doi.org/10.4230/lipics.fsttcs.2010.272openalex-snapshot

Generalizing the powerset construction, coalgebraically

inferredcites →https://doi.org/10.5860/choice.48-1533openalex-snapshot

Elements of automata theory

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-031-24117-8_3openalex-snapshot

Minimisation in Logical Form

inferred← citeshttps://doi.org/10.1007/978-3-031-77019-7_6openalex-snapshot

Dual Adjunction Between $$\varOmega $$-Automata and Wilke Algebra Quotients

inferred← citeshttps://doi.org/10.1007/978-3-032-12846-1_6openalex-snapshot

Analyzing and Comparing the Stream Theory: A Review

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-10882-7_3openalex-snapshot

A Logical Descriptor for Regular Languages via Stone Duality

inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_11openalex-snapshot

Regular Varieties of Automata and Coequations

inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_4openalex-snapshot

Derivatives of Quantitative Regular Expressions

inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_3openalex-snapshot

The Power of Symbolic Automata and Transducers

inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4openalex-snapshot

Verification, Model Checking, and Abstract Interpretation

inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_23openalex-snapshot

Stability and Complexity of Minimising Probabilistic Automata

inferred← citeshttps://doi.org/10.1007/978-3-662-46678-0_10openalex-snapshot

Coalgebraic Trace Semantics via Forgetful Logics

inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_35openalex-snapshot

Equations and Coequations for Weighted Automata

inferred← citeshttps://doi.org/10.1007/s41870-025-02644-4openalex-snapshot

On Brzozowski’s algorithm, pumping lemma, and monoid representation for a typical hesitant fuzzy multiset language

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.2014.10.002openalex-snapshot

On Continuous Nondeterminism and State Minimality

inferred← citeshttps://doi.org/10.1016/j.entcs.2016.09.042openalex-snapshot

Coalgebraic Minimization of Automata by Initiality and Finality

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.2016.03.007openalex-snapshot

Quantitative simulations by matrices

inferred← citeshttps://doi.org/10.1016/j.ic.2020.104649openalex-snapshot

Bisimulation metrics and norms for real-weighted automata

inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106133openalex-snapshot

Weighted automata are compact and actively learnable

inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.09.002openalex-snapshot

Behavioural equivalences for coalgebras with unobservable moves

inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.12.005openalex-snapshot

Concurrent Kleene algebra with tests and branching automata

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.2016.12.025openalex-snapshot

Promise problems solved by quantum and classical finite automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.038openalex-snapshot

Languages and models for hybrid automata: A coalgebraic perspective

inferred← citeshttps://doi.org/10.1017/s0960129519000094openalex-snapshot

Singular value automata and approximate minimization

inferred← citeshttps://doi.org/10.1109/lics.2015.70openalex-snapshot

A Canonical Form for Weighted Automata and Applications to Approximate Minimization

inferred← citeshttps://doi.org/10.1145/2766189.2766193openalex-snapshot

A short introduction to the coalgebraic method

inferred← citeshttps://doi.org/10.1145/2933575.2934575openalex-snapshot

Duality in Computer Science

inferred← citeshttps://doi.org/10.1145/3090064.3090066openalex-snapshot

Automata and minimization

inferred← citeshttps://doi.org/10.1145/3209108.3209177openalex-snapshot

An Algebraic Theory of Markov Processes

inferred← citeshttps://doi.org/10.1145/3290337openalex-snapshot

Better late than never: a fully-abstract semantics for classical processes

inferred← citeshttps://doi.org/10.1145/3808318openalex-snapshot

Weighted NetKAT: A Programming Language for Quantitative Network Verification

inferred← citeshttps://doi.org/10.20868/upm.thesis.64479openalex-snapshot

New Perspectives on Classical Automata Constructions

inferred← citeshttps://doi.org/10.2168/lmcs-12(4:10)2016openalex-snapshot

Coalgebraic trace semantics via forgetful logics

inferred← citeshttps://doi.org/10.23638/lmcs-16(1:32)2020openalex-snapshot

Automata Minimization: a Functorial Approach

inferred← citeshttps://doi.org/10.4204/eptcs.351.18openalex-snapshot

Canonical Automata via Distributive Law Homomorphisms

inferred← citeshttps://doi.org/10.4230/lipics.fscd.2021.28openalex-snapshot

Coalgebra Encoding for Efficient Minimization

inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.77openalex-snapshot

A Congruence-based Perspective on Automata Minimization Algorithms

inferred← citeshttps://doi.org/10.46298/lmcs-18(3:31)2022openalex-snapshot

Minimality Notions via Factorization Systems and Examples

inferred← citeshttps://doi.org/10.46298/lmcs-18(3:4)2022openalex-snapshot

A Coalgebraic Approach to Dualities for Neighborhood Frames

inferred← citeshttps://doi.org/10.48550/arxiv.1404.6673openalex-snapshot

Stability and Complexity of Minimising Probabilistic Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1702.08017openalex-snapshot

Bisimulation Metrics for Weighted Automata

inferred← citeshttps://doi.org/10.48550/arxiv.2009.01217openalex-snapshot

Notes on Equivalence and Minimization of Weighted 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.