Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter May 1, 2014

On bigram languages

A. A. Petushko


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.

Published Online: 2014-5-1
Published in Print: 2013-12-1

© 2014 by Walter de Gruyter Berlin/Boston

Scroll Up Arrow