On bigram languages

DOI10.1515/DMA-2013-0032MaRDI QIDQ2344093zbMATH OpenOpenAlexFDO

Authors Alexandr A. Petushko

Publication date 12 May 2015

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

Full work available at URL https://doi.org/10.1515/dma-2013-0032

zbMATH Keywords

bigram languagesbigram matrixdirected graphsEuler circuitsfrequency languagesregular languages

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Formal languages and automata (68Q45)

Recommendations

• On cardinality of bigram languages
• Language theoretic properties of regular DAG languages
• Recognizable vs. Regular Picture Languages
• scientific article; zbMATH DE number 2150293
• Deciding unique decodability of bigram counts via finite automata

Cited in

(1)

• On cardinality of bigram languages

This page was built for publication: On bigram languages

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