On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
type: Item
instance of: scholarly article
title: On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
zbMATH Open document ID: 1304.68099
author: Flavio D'Alessandro
author: Benedetto Intrigila
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6375996
zbMATH Keywords: semilinear set
zbMATH Keywords: recognizable set
zbMATH Keywords: commutative equivalence
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.030
OpenAlex ID: W2037051229
cites work: Q3575467
cites work: On the structure of the counting function of sparse context-free languages.
cites work: The Parikh counting functions of sparse context-free languages are quasi-polynomials
cites work: Quasi-polynomials, linear Diophantine equations and semi-linear sets
cites work: On the commutative equivalence of bounded context-free and regular languages: the code case
cites work: On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
cites work: Teoria degli Automi Finiti
cites work: Rational sets in commutative monoids
cites work: Q4079524
cites work: Semigroups, Presburger formulas, and languages
cites work: Q5576254
cites work: Q4040797
DOI: 10.1016/J.TCS.2014.10.030
description: scientific article; zbMATH DE number 6375996