Unique decipherability in formal languages

Unique decipherability in formal languages

We consider several language-theoretic aspects of various notions of unique decipherability (or unique factorization) in formal languages. Given a language L at some position within the Chomsky hierarchy, we investigate the language of words UD(L) in L∗ that have unique factorization over L. We also...

Full description

Saved in:
Bibliographic Details
Main Authors: Paul Bell, Daniel Reidenbach, Jeffrey O Shallit
Format: Default Article
Published: 2019
Subjects:
Computation Theory & Mathematics
Information and Computing Sciences
Mathematical Sciences
codes
unique decipherability
numerical decipherability
set decipherability
multiset decipherability
Online Access:https://hdl.handle.net/2134/10548065.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/10548065.v1

Similar Items