scientific article; zbMATH DE number 7136663

zbMath1442.68116arXiv1612.02106MaRDI QIDQ4972735

Dexter Kozen, Zoltán Ésik

Publication date: 26 November 2019

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

iteration theoriesregular algebra\(\omega\)-continuous algebra

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• Algebraic solutions to recursion schemes
• A representation of trees by languages. II
• Unique fixed points vs. least fixed points
• Recursion-closed algebraic theories
• Algebraic semantics
• The IO- and OI-hierarchies
• Varieties of ordered algebras
• IO and OI. I
• IO and OI. II
• A representation of trees by languages. I
• What Are Iteration Theories?
• An automata-theoretical characterization of the OI-hierarchy
• Initial Algebra Semantics and Continuous Algebras
• Infinitary Axiomatization of the Equational Theory of Context-Free Languages
• Algebraic automata and context-free sets
• Indexed Grammars—An Extension of Context-Free Grammars