Abstract:
Set of words having the same matrix of frequencies of adjacent letters can be noted as a formal bigram language. The paper describes matrices corresponding to regular and context free bigram languages.
Keywords:Bigram language, matrix of frequencies, adjacent letters, eulerian circuits.