"The Unique Decipherability in the Monoid of Regular Languages is Undecidable."

Juhani Karhumäki, Aleksi Saarela (2011)

> Home

Details and statistics

DOI: 10.3233/FI-2011-537

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/KarhumakiS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/KarhumakiS11
Juhani Karhumäki, Aleksi Saarela:
The Unique Decipherability in the Monoid of Regular Languages is Undecidable. Fundam. Informaticae 110(1-4): 197-200 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.