Context-free event domains are recognizable

DOI10.1007/3-540-60043-4_55zbMath1496.68184OpenAlexW1526899732MaRDI QIDQ5096387

Jean Claude Raoult, Philippe Darondeau, Eric Badouel

Publication date: 16 August 2022

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00074095/file/RR-2588.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (1)

Stable trace automata vs. full trace automata

Cites Work

• On the regular structure of prefix rewriting
• The theory of ends, pushdown automata, and second-order logic
• On the consistency of Koomen's fair abstraction rule
• Effectively given domains
• A logical characterization of well branching event structures
• Extending partial isomorphisms of graphs
• Compositional relational semantics for indeterminate dataflow networks
• Connections between a concrete and an abstract model of concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Context-free event domains are recognizable