Article
Licensed
Unlicensed
Requires Authentication
On bigram languages
-
A. A. Petushko
Published/Copyright:
May 1, 2014
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.
Keywords: bigram matrix; bigram languages; frequency languages; regular languages; euler circuits; directed graphs
Published Online: 2014-5-1
Published in Print: 2013-12-1
© 2014 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Front matter
- Criterion for propositional calculi to be finitely generated
- Fast Catalan constant computation via the approximations obtained by the Kummer’s type transformations
- Cycle indices of an automaton
- Definability in the language of functional equations of a countable-valued logic
- On bigram languages
- The diagnosis of states of contacts
- Finite systems of generators of infinite subgroups of the Golod group
- On the number of cyclic points of random A-mapping
Keywords for this article
bigram matrix;
bigram languages;
frequency languages;
regular languages;
euler circuits;
directed graphs
Articles in the same Issue
- Front matter
- Criterion for propositional calculi to be finitely generated
- Fast Catalan constant computation via the approximations obtained by the Kummer’s type transformations
- Cycle indices of an automaton
- Definability in the language of functional equations of a countable-valued logic
- On bigram languages
- The diagnosis of states of contacts
- Finite systems of generators of infinite subgroups of the Golod group
- On the number of cyclic points of random A-mapping
