A new technique for proving non regularity based on the measure of a language

A new technique for proving non regularity based on the measure of a language This document summarizes a talk on a new technique for proving non-regularity of languages based on their measure (probability). It introduces the zero-one law for regular languages, which states that a regular language is either almost empty (measure 0) or almost full (measure 1). It then presents the zero lemma, which