On Bigram Languages
Abstract
We consider formal languages defined by bigram matrices and study connections between various properties of such languages, directed graphs and Eulerian circuits in these graphs. We also formulate criteria of non-emptiness, finiteness and infiniteness of languages and conditions of language regularity.
Type
Publication
Discrete Mathematics and Applications
Aleksandr Petiushko Александр Петюшко
Director, Head of ML Research / Adjunct Professor / PhD
Principal R&D Researcher (15+ years of experience), R&D Technical Leader (10+ years of experience), and R&D Manager (7+ years of experience). Running and managing industrial research and academic collaboration (35+ publications, 30+ patents). Inspired by theoretical computer science and how it changes the world.