On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)

DOI10.1016/j.tcs.2014.10.030zbMath1304.68099OpenAlexW2037051229MaRDI QIDQ476895

Flavio D'Alessandro, Benedetto Intrigila

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.030

zbMATH Keywords

semilinear setcommutative equivalencerecognizable set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On counting functions and slenderness of languages, Coding by minimal linear grammars, On the Commutative Equivalence of Algebraic Formal Series and Languages, On bounded linear codes and the commutative equivalence, On the commutative equivalence of bounded context-free and regular languages: the code case, Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity, On the commutative equivalence of bounded context-free and regular languages: the semi-linear case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the commutative equivalence of bounded context-free and regular languages: the code case
• Quasi-polynomials, linear Diophantine equations and semi-linear sets
• The Parikh counting functions of sparse context-free languages are quasi-polynomials
• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• On the structure of the counting function of sparse context-free languages.
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• Teoria degli Automi Finiti