On the commutative equivalence of semi-linear sets of N^k
From MaRDI portal
Publication:476895
DOI10.1016/J.TCS.2014.10.030zbMATH Open1304.68099OpenAlexW2037051229MaRDI QIDQ476895FDOQ476895
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
Recommendations
Cites Work
- Semigroups, Presburger formulas, and languages
- Rational sets in commutative monoids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of the counting function of sparse context-free languages.
- Theory of finite automata
- 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
- Title not available (Why is that?)
- On the commutative equivalence of bounded context-free and regular languages: the code case
- Quasi-polynomials, linear Diophantine equations and semi-linear sets
Cited In (9)
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
- Coding by minimal linear grammars
- The taming of the semi-linear set
- On the Commutative Equivalence of Algebraic Formal Series and Languages
- On counting functions and slenderness of languages
- On the commutative equivalence of bounded context-free and regular languages: the code case
- On bounded linear codes and the commutative equivalence
- Title not available (Why is that?)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
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)
