Sulla struttura combinatoria dei linguaggi bounded
This paper concerns the studying of some algebraic and algorithmical problems on the growth function of formal languages.
Guardado en:
Autores principales: | Flavio D’Alessandro, Alessandra Zinno Pilo |
---|---|
Formato: | article |
Lenguaje: | EN FR IT |
Publicado: |
Sapienza Università Editrice
2008
|
Materias: | |
Acceso en línea: | https://doaj.org/article/72bfd13273d1443cae9e3b3e8778dd0c |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
New Bounds for the Modified Bessel Function of the First Kind and Toader-Qi Mean
por: Ling Zhu
Publicado: (2021) -
Global Bounds for the Generalized Jensen Functional with Applications
por: Slavko Simić, et al.
Publicado: (2021) -
Diophantine Equations Relating Sums and Products of Positive Integers: Computation-Aided Study of Parametric Solutions, Bounds, and Distinct-Term Solutions
por: Petr Karlovsky
Publicado: (2021) -
Fingerprint-Based Data Deduplication Using a Mathematical Bounded Linear Hash Function
por: Ahmed Sardar M. Saeed, et al.
Publicado: (2021) -
Bounded in the mean solutions of a second-order difference equation
por: Mykhailo Horodnii, et al.
Publicado: (2021)