Mixed product and asynchronous automata
type: Item
instance of: scholarly article
title: Mixed product and asynchronous automata
zbMATH Open document ID: 0638.68095
DOI: 10.1016/0304-3975(86)90094-0
author: Christine Duboc
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 4041321
zbMATH Keywords: traces
zbMATH Keywords: trace languages
zbMATH Keywords: free partially commutative monoids
zbMATH Keywords: asynchronous automata
zbMATH Keywords: alphabetic morphism
zbMATH Keywords: mixed product of automata
zbMATH Keywords: synchronous products
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90094-0
OpenAlex ID: W1967959761
cites work: Trace languages defined by regular string languages
cites work: Q3859267
cites work: Combinatorial problems of commutation and rearrangements
cites work: A remark on the representation of trace monoids
cites work: Recognizable subsets of some partially Abelian monoids
cites work: Q3736919
cites work: Langages infinitaires et produit de mixage
cites work: On some equations in free partially commutative monoids
cites work: Maximal serializability of iterated transactions
cites work: Q3696528
cites work: Q3725561
cites work: The serializability of concurrent database updates
description: scientific article; zbMATH DE number 4041321