Minimisation in logical form
From MaRDI portal
Publication:6612779
DOI10.1007/978-3-031-24117-8_3MaRDI QIDQ6612779
Clemens Kupke, Dexter Kozen, Marcello M. Bonsangue, Helle Hvid Hansen, Prakash Panangaden, Alexandra Silva, Nick Bezhanishvili
Publication date: 1 October 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A coalgebraic perspective on linear weighted automata
- The dual equivalence of equations and coequations for automata
- On equations for regular languages, finite automata, and sequential networks
- Foundations of system theory: The Hankel matrix
- Succinct representation of regular languages by Boolean automata
- Domain theory in logical form
- Adjoint machines, state-behavior machines, and duality
- Structural induction and coinduction in a fibrational setting
- Sets of independent postulates for the algebra of logic.
- Universal coalgebra: A theory of systems
- Coalgebraic minimization of automata by initiality and finality
- Theory of computation.
- On the relevance of abstract algebra to control theory
- Duality in analysis from the point of view of triples
- The formal theory of monads
- Modal logic
- Stone Duality and the Recognisable Languages over an Algebra
- A Coalgebraic Perspective on Minimization and Determinization
- Generalizing the powerset construction, coalgebraically
- Minimization via Duality
- Regular Varieties of Automata and Coequations
- Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions
- Coalgebraic trace semantics via forgetful logics
- Exemplaric Expressivity of Modal Logics
- On the definition of a family of automata
- Duality and Equational Theory of Regular Languages
- Introduction to Boolean Algebras
- Alternation
- Adjoint Lifting Theorems for Categories of Algebras
- Generalized Eilenberg Theorem
- Varieties of Languages in a Category
- Machines in a Category: An Expository Introduction
- Continuous Lattices and Domains
- A congruence-based perspective on automata minimization algorithms
- Coalgebraic Modal Logic Beyond Sets
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- Foundations of Software Science and Computational Structures
- Duality of Equations and Coequations via Contravariant Adjunctions
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- The Theory of Representation for Boolean Algebras
- Topological representations of distributive lattices and Brouwerian logics
- Foundations of Software Science and Computation Structures
- Free sets and free subsemimodules in a semimodule
This page was built for publication: Minimisation in logical form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612779)
