On the commutative equivalence of bounded context-free and regular languages: the code case

DOI10.1016/J.TCS.2014.10.005MaRDI QIDQ476875zbMATH 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.005

zbMATH Keywords

semilinear setbounded context-free languagecommutative equivalence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the commutative equivalence of bounded context-free and regular languages
• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• On the commutative equivalence of context-free languages
• On commutative context-free languages
• scientific article; zbMATH DE number 3880130
• On regularity of context-free languages
• A note on equations for commutative regular languages
• Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
• scientific article; zbMATH DE number 3481858
• scientific article; zbMATH DE number 5519566

Cites work

• scientific article; zbMATH DE number 3880130 (Why is no real title available?)
• scientific article; zbMATH DE number 3978429 (Why is no real title available?)
• scientific article; zbMATH DE number 3540385 (Why is no real title available?)
• scientific article; zbMATH DE number 3578342 (Why is no real title available?)
• scientific article; zbMATH DE number 1259068 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• A characterization of poly-slender context-free languages
• A decision method for Parikh slenderness of context-free languages
• Analytic models and ambiguity of context-free languages
• Decision problems concerning thinness and slenderness of formal languages
• On Context-Free Languages
• On Parikh slender context-free languages
• On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
• On the generating sequences of regular languages on \(k\) symbols
• 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
• There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages

Cited in

(12)

• On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
• On the commutative equivalence of bounded context-free and regular languages
• Coding by minimal linear grammars
• On the Commutative Equivalence of Algebraic Formal Series and Languages
• On counting functions and slenderness of languages
• On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
• On bounded linear codes and the commutative equivalence
• A Fully Equational Proof of Parikh's Theorem
• Semi-linearity, Parikh-boundedness and tree adjunct languages
• Commutative one-counter languages are regular
• On the commutative equivalence of context-free languages
• Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity

This page was built for publication: On the commutative equivalence of bounded context-free and regular languages: the code case

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