Sublogarithmic Ambiguity

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 : N → N 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∗ .

• Type: Conference
• Year: 2004
• Where: MFCS
• Authors: Klaus Wich
• Keywords: Computable Divergent, Divergent Inherent Ambiguity, Inherent Ambiguity Functions, MFCS 2004