Context-free event domains are recognizable
type: Item
instance of: scholarly article
title: Context-free event domains are recognizable
zbMATH Open document ID: 0928.68050
author: Eric Badouel
author: Philippe Darondeau
author: Jean Claude Raoult
published in: Information and Computation
publication date: 1999-05-03T00:00:00Z
full work available at URL: RR-2588.pdf
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 1283688
zbMATH Keywords: Stark's trace automata
MaRDI profile type: Publication
OpenAlex ID: W2079207854
cites work: On the consistency of Koomen's fair abstraction rule
cites work: Decidability of bisimulation equivalence for process generating context-free languages
cites work: Q5615282
cites work: Flow models of distributed computations: Three equivalent semantics for CCS
cites work: Q5525343
cites work: On the regular structure of prefix rewriting
cites work: Q4385531
cites work: Q3785893
cites work: Q5748880
cites work: Extending partial isomorphisms on finite structures
cites work: Extending partial isomorphisms of graphs
cites work: A logical characterization of well branching event structures
cites work: The theory of ends, pushdown automata, and second-order logic
cites work: Petri nets, event structures and domains. I
cites work: Q4857386
cites work: Q3832541
cites work: Effectively given domains
cites work: Connections between a concrete and an abstract model of concurrent systems
cites work: Compositional relational semantics for indeterminate dataflow networks
cites work: Q4733435
DOI: 10.1006/INCO.1998.2752
description: scientific article; zbMATH DE number 1283688