The Unique Decipherability in the Monoid of Regular Languages is Undecidable

Juhani Karhumaki; Aleksi Saarela

首页> 外文期刊>Fundamenta Informaticae >The Unique Decipherability in the Monoid of Regular Languages is Undecidable

【24h】

The Unique Decipherability in the Monoid of Regular Languages is Undecidable

机译：常规语言的半边形中的唯一可解密性是不确定的

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

团队文献服务 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We show by a simple reduction that the unique decipherability problem in the language monoid of regular languages over a non-unary alphabet is undecidable.

机译：我们通过简单的还原表明，在非一元字母上常规语言的语言半边形中的唯一可解码性问题是无法确定的。

著录项

来源
《Fundamenta Informaticae 》 |2011年第4期| p.197-200| 共4页
作者
Juhani Karhumaki; Aleksi Saarela;
展开▼
作者单位

Department of Mathematics and Turku Centre for Computer Science TUCS University of Turku, FI-20014 Turku, Finland;

Department of Mathematics and Turku Centre for Computer Science TUCS University of Turku, FI-20014 Turku, Finland;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. Unique Decipherability in the Monoid of Languages: An Application of Rational Relations [J] . Christian Choffrut, Juhani Karhumaki Theory of computing systems . 2011 ,第2期

机译：语言半体中的独特可解密性：理性关系的应用
2. It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton [J] . Bojanczyk Mikolaj Fundamenta Informaticae . 2017 ,第1a4期

机译：能否通过确定性的树遍历自动机来分隔两种常规树语言是不确定的
3. Undecidability in ω-Regular Languages [J] . Vesa Halava, Tero Harju, Juhani Karhumaeki Fundamenta Informaticae . 2006 ,第1a2期

机译：ω-常规语言的不确定性
4. Unique Decipherability in the Monoid of Languages: An Application of Rational Relations [C] . Christian Choffrut, Juhani Karhumaeki Computer science-theory and applications . 2009

机译：语言半体中的独特可解密性：理性关系的应用
5. Learning Regular Languages and Automaton Graphs. [D] . Chen, Dongqu. 2016

机译：学习常规语言和自动机图。
6. Existence of constants in regular splicing languages [O] . Paola Bonizzoni, Nataša Jonoska -1

机译：常规拼接语言中常量的存在
7. Unique Decipherability in the Monoid of Languages: An Application of Rational Relations [O] . Christian Choffrut, Juhani Karhumäki 2009

机译：单一语言的独特可解密性：合理关系的应用
8. Operations on N-varieties of regular (omega)-languages and products on regular (omega)-languages [R] . Phan Trung Huy, Do Long Van 1995

机译：在常规（ω）语言上对N种常规（ω）语言和产品进行操作

The Unique Decipherability in the Monoid of Regular Languages is Undecidable

摘要

著录项

相似文献

相关主题

期刊订阅