From Grammars and Automata to Algebras and Coalgebras

DOI10.1007/978-3-642-21493-6_2zbMath1307.68043OpenAlexW81484246MaRDI QIDQ3014929

Peter Padawitz

Publication date: 8 July 2011

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21493-6_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Uses Software

• Stratego

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rewriting logic semantics project
• Final algebra semantics and data type extensions
• More on advice on structuring compilers and proving them correct
• Swinging types=functions+relations+transition systems
• A hidden agenda
• Universal coalgebra: A theory of systems
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• On tree coalgebras and coalgebra presentations
• Terminal coalgebras in well-founded set theory
• A fixpoint theorem for complete categories
• Coequalizers and free triples
• Adjoint Folds and Unfolds
• Algebraic specification of data types: A synthetic approach
• Final Data Types and Their Specification
• Initial Algebra Semantics and Continuous Algebras
• Abstract data types and software validation
• Final Coalgebras are Ideal Completions of Initial Algebras
• Parametrized data types do not need highly constrained parameters
• Coalgebras of bounded type
• A Coalgebraic View of Infinite Trees and Iteration
• From Varieties of Algebras to Covarieties of Coalgebras
• When is a function a fold or an unfold?
• Derivatives of Regular Expressions
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages

This page was built for publication: From Grammars and Automata to Algebras and Coalgebras