On cardinality of bigram languages

DOI10.1515/DMA-2014-0015zbMATH Open1325.68132OpenAlexW2085522680MaRDI QIDQ892610FDOQ892610

Authors: Alexandr A. Petushko 

Publication date: 11 November 2015

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2014-0015

Recommendations

• On bigram languages
• Counting Finite Languages by Total Word Length
• scientific article; zbMATH DE number 3997184
• scientific article; zbMATH DE number 1408345
• On the number of occurrences of a symbol in words of regular languages.

zbMATH Keywords

directed graphsregular languagesbigram languagesbigram multiplicity matrixEuler circuitsfrequency languageslanguage cardinality

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (2)

• On bigram languages
• The two-cardinal problem for languages of arbitrary cardinality

This page was built for publication: On cardinality of bigram languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892610)