On bounded rational trace languages
type: Item
instance of: scholarly article
title: On bounded rational trace languages
zbMATH Open document ID: 1209.68295
author: Christian Choffrut
author: Flavio D'Alessandro
author: Stefano Varricchio
published in: Theory of Computing Systems
publication date: 2010-05-10T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5706007
zbMATH Keywords: trace languages
zbMATH Keywords: bounded languages
zbMATH Keywords: rational relations
MaRDI profile type: Publication
full work available at URL: s00224-008-9143-9
OpenAlex ID: W2148580794
cites work: Interpolated Denumerants and Lambert Series
cites work: Q3859267
cites work: Q4730801
cites work: Q4452059
cites work: On the separability of sparse context-free languages and of bounded rational relations
cites work: On the structure of the counting function of sparse context-free languages.
cites work: Q4231020
cites work: Q3742744
cites work: Q4079524
cites work: Rational sets in commutative monoids
cites work: Q5576254
cites work: Q3659988
cites work: Sur les rélations rationnelles entre monoides libres
DOI: 10.1007/S00224-008-9143-9
Recommended article: Rational and recognizable complex trace languages
Recommended article: Q4281552
Recommended article: A note on the logical definability of rational trace languages
Recommended article: Logical definability of some rational trace languages
Recommended article: On regular trace languages
Recommended article: Q4508302
Recommended article: Q4035660
Recommended article: Q4035659
Recommended article: Q3336723
Recommended article: Q3318129
description: scientific article; zbMATH DE number 5706007