RUS  ENG
Full version
JOURNALS // Intelligent systems. Theory and applications // Archive

Intelligent systems. Theory and applications, 2016 Volume 20, Issue 2, Pages 331–336 (Mi ista134)

Chomsky classification for matrices of bigram languages

A. A. Petyushkoa, D. N. Babinb

a Lomonosov Moscow State University
b Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

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.



© Steklov Math. Inst. of RAS, 2024