This new approach to formal language definition aims to model situation where several computational processes must agree in order to recognize a string as valid. Although using as basic device a finite deterministic machine, the consensual model is able to define a broader family of languages than the regular ones. while preserving polynomial time complexity.