Minimisation in logical form

DOI10.1007/978-3-031-24117-8_3MaRDI QIDQ6612779zbMATH OpenFDO

Authors Nick Bezhanishvili, Marcello M. Bonsangue, Helle Hvid Hansen, Dexter Kozen, Clemens Kupke, Prakash Panangaden, Alexandra Silva

Publication date 1 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-24117-8_3

zbMATH Keywords

dualityalgebraautomatacoalgebramodal logicminimisation

Mathematics Subject Classification ID

Quantum computation (81P68) Logic in computer science (03B70) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1705159 (Why is no real title available?)
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 3787631 (Why is no real title available?)
• scientific article; zbMATH DE number 19040 (Why is no real title available?)
• scientific article; zbMATH DE number 3536754 (Why is no real title available?)
• scientific article; zbMATH DE number 692330 (Why is no real title available?)
• scientific article; zbMATH DE number 6917169 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• scientific article; zbMATH DE number 3296290 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• A Coalgebraic Perspective on Minimization and Determinization
• A coalgebraic perspective on linear weighted automata
• A congruence-based perspective on automata minimization algorithms
• Adjoint Lifting Theorems for Categories of Algebras
• Adjoint machines, state-behavior machines, and duality
• Algebra-coalgebra duality in Brzozowski's minimization algorithm
• Alternation
• Coalgebraic minimization of automata by initiality and finality
• Coalgebraic modal logic beyond sets
• Coalgebraic trace semantics via forgetful logics
• Continuous Lattices and Domains
• Domain theory in logical form
• Duality and Equational Theory of Regular Languages
• Duality in analysis from the point of view of triples
• Duality of equations and coequations via contravariant adjunctions
• Exemplaric Expressivity of Modal Logics
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computational Structures
• Foundations of system theory: The Hankel matrix
• Free sets and free subsemimodules in a semimodule
• Generalized Eilenberg theorem. Varieties of languages in a category
• Generalizing the powerset construction, coalgebraically
• Introduction to Boolean Algebras
• Lifting adjunctions to coalgebras to (re)discover automata constructions
• Machines in a Category: An Expository Introduction
• Minimization via duality
• Modal logic
• On equations for regular languages, finite automata, and sequential networks
• On the definition of a family of automata
• On the relevance of abstract algebra to control theory
• Regular varieties of automata and coequations
• Sets of independent postulates for the algebra of logic.
• Stone duality and the recognisable languages over an algebra
• Structural induction and coinduction in a fibrational setting
• Succinct representation of regular languages by Boolean automata
• The Theory of Representation for Boolean Algebras
• The dual equivalence of equations and coequations for automata
• The formal theory of monads
• Theory of computation.
• Topological representations of distributive lattices and Brouwerian logics
• Universal coalgebra: A theory of systems
• Varieties of Languages in a Category

Cited in

(1)

• Dual adjunction between -automata and Wilke algebra quotients

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)