The Unique Decipherability in the Monoid of Regular Languages is Undecidable (Q3100936)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Unique Decipherability in the Monoid of Regular Languages is Undecidable |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Unique Decipherability in the Monoid of Regular Languages is Undecidable |
scientific article |
Statements
The Unique Decipherability in the Monoid of Regular Languages is Undecidable (English)
0 references
22 November 2011
0 references
unique decipherability
0 references
regular languages
0 references
non-unary alphabet
0 references
decidability
0 references
