On some decision problems for trace codings
type: Item
instance of: scholarly article
title: On some decision problems for trace codings
zbMATH Open document ID: 0873.68170
DOI: 10.1016/0304-3975(95)00036-V
author: Véronique Bruyère
author: Clelia De Felice
author: Giovanna Guaiana
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 984927
zbMATH Keywords: trace monoids
MaRDI profile type: Publication
cites work: Characterizations of the decidability of some problems for regular trace languages
cites work: Theory of traces
cites work: Q4099676
cites work: Q4430300
cites work: Q4942647
cites work: Q4430282
cites work: Combinatorial problems of commutation and rearrangements
cites work: A remark on the representation of trace monoids
cites work: Q3773822
cites work: Recognizable subsets of some partially Abelian monoids
cites work: Q3736919
cites work: Combinatorics on traces
cites work: On codings of traces
cites work: On some equations in free partially commutative monoids
cites work: Q3328583
cites work: Parallel concepts in graph theory
cites work: Graphs and free partially commutative monoids
cites work: Q3659988
cites work: Q3771629
cites work: Q3798889
cites work: A Note on "The Comparability Graph of a Tree"
full work available at URL: 0304-3975(95)00036-v
OpenAlex ID: W2088388166
Recommended article: Undecidability of the trace coding problem and some decidable cases
Recommended article: On codings of traces
Recommended article: On the dimension of trace codes
Recommended article: Q4535801
Recommended article: Q4027650
Recommended article: Q4376064
Recommended article: Q4276331
Recommended article: Q2947388
Recommended article: On factorizing codes: Structural properties and related decision problems
Recommended article: A Note About the Traceability Properties of Linear Codes
description: scientific article; zbMATH DE number 984927