On the Commutative Equivalence of Algebraic Formal Series and Languages
From MaRDI portal
Publication:6114824
DOI10.1142/s0129054121500192zbMath1522.68261OpenAlexW3120475523MaRDI QIDQ6114824
Flavio D'Alessandro, Arturo Carpi
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054121500192
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Prefix, length-variable, comma-free codes (94A45)
Cites Work
- 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\)
- A counterexample to the triangle conjecture
- 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
- Minimal complete sets of words
- Decision problems concerning thinness and slenderness of formal languages
- An example of an indexed language of intermediate growth
- Some combinatorial results on Bernoulli sets and codes
- Context-free languages of sub-exponential growth
- On the commutative equivalence of context-free languages
- On counting functions of languages
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
- On finite-index indexed grammars and their restrictions
- 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
- On the commutative equivalence of bounded semi-linear codes
- On counting functions and slenderness of languages
- Semigroups, Presburger formulas, and languages
- On the generating sequences of regular languages on k symbols
- The characterization of nonexpansive grammars by rational power series
- Conjectures on uniquely decipherable codes (Corresp.)
- A characterization of poly-slender context-free languages
- Inherent ambiguity of minimal linear grammars
- Indexed Grammars—An Extension of Context-Free Grammars
- On the index of a context-free grammar and language
- The growth function of context-free languages
- On Parikh slender context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Commutative Equivalence of Algebraic Formal Series and Languages
