Regular Varieties of Automata and Coequations

DOI10.1007/978-3-319-19797-5_11zbMath1432.68270OpenAlexW2295444426MaRDI QIDQ2941177

Marcello M. Bonsangue, Julian Salamanca, Enric Cosme-Llópez, Jan J. M. M. Rutten, Adolfo Ballester-Bolinches

Publication date: 27 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19797-5_11

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Equational logic, Mal'tsev conditions (08B05)

Related Items (1)

Duality of Equations and Coequations via Contravariant Adjunctions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dual equivalence of equations and coequations for automata
• Universal coalgebra: A theory of systems
• Copatterns
• Duality and Equational Theory of Regular Languages
• Modal operators and the formal dual of Birkhoffs completeness theorem This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction of Dana Scott.
• Theoretical Aspects of Computing – ICTAC 2005
• Algebra-coalgebra duality in brzozowski's minimization algorithm
• Generalized Eilenberg Theorem I: Local Varieties of Languages
• On a method of construction of abstract algebras

This page was built for publication: Regular Varieties of Automata and Coequations