Continuous Additive Algebras and Injective Simulations of Synchronization Trees

DOI10.1093/logcom/12.2.271zbMath1003.06003OpenAlexW2075548256WikidataQ114091821 ScholiaQ114091821MaRDI QIDQ4542239

Zoltán Ésik

Publication date: 30 January 2003

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/12.2.271

zbMATH Keywords

fixed pointssimulationequational logicsynchronization trees

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Categorical semantics of formal languages (18C50) Free algebras (08B20)

Related Items (max. 100)

A connection between concurrency and language theory ⋮ Axiomatizing the equational theory of regular tree languages ⋮ Unnamed Item ⋮ A Mezei-Wright theorem for categorical algebras ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics

This page was built for publication: Continuous Additive Algebras and Injective Simulations of Synchronization Trees