On the commutative equivalence of context-free languages

DOI10.1007/978-3-319-98654-8_14OpenAlexW2886731079MaRDI QIDQ1622958

Arturo Carpi, Flavio D'Alessandro

Publication date: 22 November 2018

Full work available at URL: http://hdl.handle.net/11573/1138991

zbMATH Keywords

context-free languageexponential growthcommutative equivalenceuniquely decipherable code

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Coding by minimal linear grammars ⋮ On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ On bounded linear codes and the commutative equivalence

This page was built for publication: On the commutative equivalence of context-free languages