Equational axioms associated with finite automata for fixed point operations in cartesian categories

DOI10.1017/S0960129515000031zbMath1364.68267arXiv1501.02190OpenAlexW1970133423MaRDI QIDQ2973247

Zoltán Ésik

Publication date: 3 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.02190

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Equational classes, universal algebra in model theory (03C05)

Related Items (3)

Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ Equational properties of fixed-point operations in cartesian categories: An overview

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed-point operations on ccc's. I
• Equational properties of iteration in algebraically complete categories
• Group axioms for iteration
• The equational logic of fixed points
• Completeness of Park induction
• Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
• THE POWER OF THE GROUP-IDENTITIES FOR ITERATION
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES

This page was built for publication: Equational axioms associated with finite automata for fixed point operations in cartesian categories