|
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.
Citation:
A. A. Petyushko, D. N. Babin, “Chomsky classification for matrices of bigram languages”, Intelligent systems. Theory and applications, 20:2 (2016), 331–336
Linking options:
https://www.mathnet.ru/eng/ista134 https://www.mathnet.ru/eng/ista/v20/i2/p331
|
Statistics & downloads: |
Abstract page: | 111 | Full-text PDF : | 88 |
|