On the commutative equivalence of bounded context-free and regular languages: the code case
type: Item
instance of: scholarly article
title: On the commutative equivalence of bounded context-free and regular languages: the code case
zbMATH Open document ID: 1304.68098
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: 6375985
zbMATH Keywords: bounded context-free language
zbMATH Keywords: semilinear set
zbMATH Keywords: commutative equivalence
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.005
OpenAlex ID: W2051092114
cites work: On the generating sequences of regular languages on k symbols
cites work: Q4147596
cites work: Q5526125
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 semi-linear sets of \(\mathbb{N}^k\)
cites work: Q4231020
cites work: Rational sets in commutative monoids
cites work: Analytic models and ambiguity of context-free languages
cites work: Q5576254
cites work: Semigroups, Presburger formulas, and languages
cites work: A decision method for Parikh slenderness of context-free languages
cites work: Decision problems concerning thinness and slenderness of formal languages
cites work: On Parikh slender context-free languages
cites work: Q3742754
cites work: A characterization of poly-slender context-free languages
cites work: There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
cites work: Q3345795
cites work: On Context-Free Languages
cites work: Q4116077
DOI: 10.1016/J.TCS.2014.10.005
Recommended article: On the commutative equivalence of bounded context-free and regular languages
Recommended article: On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
Recommended article: On the commutative equivalence of context-free languages
Recommended article: On commutative context-free languages
Recommended article: Q3345795
Recommended article: On regularity of context-free languages
Recommended article: A note on equations for commutative regular languages
Recommended article: Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Recommended article: Q4065052
Recommended article: Q3606478
description: scientific article; zbMATH DE number 6375985