Sulla struttura combinatoria dei linguaggi bounded

Abstract

This paper concerns the studying of some algebraic and algorithmical problems on the growth function of formal languages.

Keywords

• bounded language
• context-free language
• growth function