Unique decipherability in formal languages

Bell, Paul C.; Reidenbach, Daniel; Shallit, Jeffrey

doi:10.1016/j.tcs.2019.11.022

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here we consider a superset of codes named set decipherable languages [6,1]. Intuitively, a set decipherable language is a set of words such that any product of these words can be uniquely deciphered up to both commutativity of elements and the number of occurrences of elements.…”

Section: Introductionmentioning

confidence: 99%

Set Decipherable Languages and Generators

Duc

2020

JCC

View full text Add to dashboard Cite

We investigate the problem to characterize whether the infinite product of a given language $L$ is generated by an $\omega$-code. Up to now, this problem is open even if language $L$ is a finite language.In this work, we consider a class of languages named $\omega$-set decipherable languages which are very close to the $\omega$-codes. We solve the problem in the restricted case where $L$ is $\omega$-set decipherable and $L^*$ is the greatest generator of $L^\omega$.

show abstract

Section: Introductionmentioning

confidence: 99%