We show the existence of rational trace languages defined over direct products of free monoids that have inherent ambiguity of the order of log n and n 1/2 . This result is obtained by studying the relationship between trace languages and linear context-free grammars that satisfy a special unambiguity condition on the position of the last step of derivation
