Language preorder as a precongruence
type: Item
instance of: scholarly article
title: Language preorder as a precongruence
zbMATH Open document ID: 0944.68101
DOI: 10.1016/S0304-3975(98)00267-9
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1493444
zbMATH Keywords: language preorder
zbMATH Keywords: precongruence
zbMATH Keywords: Tyft format
zbMATH Keywords: predicates
author: Wan Fokkink
MaRDI profile type: Publication
cites work: A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
cites work: Q4727412
cites work: Process Algebra
cites work: Process algebra for synchronous communication
cites work: Structural operational semantics for weak bisimulations
cites work: The meaning of negative premises in transition system specifications
cites work: Q5639639
cites work: \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
cites work: Q5590815
cites work: Q3753475
cites work: Transition system specifications with negative premises
cites work: Structured operational semantics and bisimulation as a congruence
cites work: On the Forms of the Predicates in the Theory of Constructive Ordinals
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: A calculus of communicating systems
cites work: Q3907077
cites work: Two Complete Axiom Systems for the Algebra of Regular Events
cites work: Q4847024
description: scientific article; zbMATH DE number 1493444