On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
From MaRDI portal
Publication:2257288
DOI10.1016/j.tcs.2015.01.008zbMath1318.68103OpenAlexW1998973847MaRDI QIDQ2257288
Benedetto Intrigila, Flavio D'Alessandro
Publication date: 24 February 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.008
Related Items (7)
On counting functions and slenderness of languages ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ 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 semi-linear sets of \(\mathbb{N}^k\) ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Cites Work
- Unnamed Item
- On the commutative equivalence of bounded context-free and regular languages: the code case
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- Analytic models and ambiguity of context-free languages
- Decision problems concerning thinness and slenderness of formal languages
- On the structure of the counting function of sparse context-free languages.
- Rational sets in commutative monoids
This page was built for publication: On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
