Aperiodic languages in concurrency monoids
type: Item
instance of: scholarly article
title: Aperiodic languages in concurrency monoids
zbMATH Open document ID: 0853.68132
published in: Information and Computation
publication date: 1996-12-12T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 896653
zbMATH Keywords: automata with concurrency relations
zbMATH Keywords: labelled transition systems
author: Manfred Droste
MaRDI profile type: Publication
full work available at URL: inco.1996.0039
OpenAlex ID: W1977150987
DOI: 10.1006/INCO.1996.0039
Recommended article: Recognizable languages in concurrency monoids
Recommended article: A kleene theorem for recognizable languages over concurrency monoids
Recommended article: Q4035659
Recommended article: Programs over aperiodic monoids
Recommended article: A connection between concurrency and language theory
Recommended article: Q3746904
Recommended article: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Recommended article: Q4001349
Recommended article: Languages recognized by finite aperiodic groupoids
description: scientific article; zbMATH DE number 896653