On the commutative equivalence of semi-linear sets of N^k

DOI10.1016/J.TCS.2014.10.030MaRDI QIDQ476895zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The taming of the semi-linear set
• On the commutative equivalence of bounded semi-linear codes
• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• On bounded linear codes and the commutative equivalence
• scientific article; zbMATH DE number 4097336

Cites work

• scientific article; zbMATH DE number 5761834 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• On the commutative equivalence of bounded context-free and regular languages: the code case
• 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.
• Quasi-polynomials, linear Diophantine equations and semi-linear sets
• Rational sets in commutative monoids
• Semigroups, Presburger formulas, and languages
• The Parikh counting functions of sparse context-free languages are quasi-polynomials
• Theory of finite automata

Cited in

(9)

• Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
• On the Commutative Equivalence of Algebraic Formal Series and Languages
• Coding by minimal linear grammars
• On bounded linear codes and the commutative equivalence
• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• scientific article; zbMATH DE number 4001487 (Why is no real title available?)
• The taming of the semi-linear set
• On counting functions and slenderness of languages
• On the commutative equivalence of bounded context-free and regular languages: the code case

This page was built for publication: On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476895)