On uniqueness of alphabetical decoding of -regular languages

DOI10.1515/DMA-2014-0014zbMATH Open1325.68129OpenAlexW2019513092MaRDI QIDQ892608FDOQ892608

Authors: Petr S. Dergach 

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-0014

zbMATH Keywords

\(\omega\)-regular languagealphabetical codinguniqueness of decoding

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: On uniqueness of alphabetical decoding of \({\omega}\)-regular languages

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