Abstract
So far the least growth rate known for a divergent inherent ambiguity function was logarithmic. This paper shows that for each computable divergent total non-decreasing function f : ℕ → ℕ there is a context-free language L with a divergent inherent ambiguity function g below f. This proves that extremely slow growing divergent inherent ambiguity functions exist. For instance there is a context-free language L with infinite inherent ambiguity below log*. © Springer-Verlag 2004.
Cite
CITATION STYLE
Wich, K. (2004). Sublogarithmic ambiguity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3153, 794–806. https://doi.org/10.1007/978-3-540-28629-5_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
