Computing maximal Kleene closures that are embeddable in a given subword-closed language

Stavros Konstantinidis; Nicolae Santean

首页> 外文期刊>Natural Computing >Computing maximal Kleene closures that are embeddable in a given subword-closed language

【24h】

Computing maximal Kleene closures that are embeddable in a given subword-closed language

机译：计算可嵌入给定子词封闭语言的最大Kleene闭包

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

Motivated by certain coding techniques for reliable DNA computing, we consider the problem of characterizing nontrivial languages D that are maximal with the property that D is contained in the subword closure of a given set S of words of some fixed length k. This closure is simply the set of all words whose sub-words of length k must be in S. We provide a deep structural characterization of these languages D, which leads to polynomial time algorithms for computing such languages.

机译：由于某些用于可靠的DNA计算的编码技术的推动，我们考虑了表征非平凡语言D的问题，该语言最大的特性是D包含在某个固定长度k的给定单词S的子单词闭包中。该闭包只是所有单词的集合，这些单词的长度为k的子单词必须在S中。我们提供了这些语言D的深入结构特征，这导致了用于计算此类语言的多项式时间算法。

著录项

来源
《Natural Computing》 |2013年第2期|211-222|共12页
作者
Stavros Konstantinidis; Nicolae Santean;
展开▼
作者单位

Department of Mathematics and Computing Science,Saint Mary's University,Halifax,NS B3H 3C3,Canada;

Department of Mathematics and Computing Science,Saint Mary's University,Halifax,NS B3H 3C3,Canada;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
Algorithm; Automaton; Code; DNA encodings; Maximal; Regular language; Subword closure;

机译：算法;自动机码;DNA编码;最大普通语言;子词关闭;

相似文献

外文文献
中文文献
专利

1. Petri Net Methods of Constructing Kleene-Closure Operations of Regular Languages [J] . WenJuan Lian, Hao Fan, YuYue Du, Information Technology Journal . 2008,第4期

机译：构造正规语言的Kleene-closure操作的Petri网方法
2. Petri Net Methods of Constructing Kleene-Closure Operations of Regular Languages [J] . WenJuan Lian, Hao Fan, YuYue Du, Information Technology Journal . 2008,第4期

机译：构造正规语言的Kleene-closure操作的Petri网方法
3. Computing Maximal Error-detecting Capabilities and Distances of Regular Languages [J] . Stavros Konstantinidis, Pedro V. Silva Fundamenta Informaticae . 2010,第4期

机译：计算常规语言的最大错误检测能力和距离
4. Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language* [C] . Stavros Konstantinidis, Nicolae Santean DNA computing and molecular programming . 2011

机译：计算可嵌入给定约束DNA语言的最大Kleene闭合*
5. Receiver-cost cognizant maximal lifetime routing in embedded networks: Model and solutions. [D] . Deng, Guofeng. 2009

机译：嵌入式网络中接收者成本认知的最大生存期路由：模型和解决方案。
6. Corrigendum: Effects of Two Teaching Strategies on Preschoolers Oral Language Skills: Repeated Read-Aloud With Question and Answer Teaching Embedded and Repeated Read-Aloud With Executive Function Activities Embedded [O] . Hsin Ying Chien 2020

机译：勘误：两种教学策略对学龄前儿童口语技能的影响：重复问答式嵌入式朗读和嵌入执行功能活动的重复朗读
7. Petri Net Methods of Constructing Kleene-Closure Operations of Regular Languages [O] . WenJuan Lian, Hao Fan, YuYue Du, 2008

机译：培养普通语言的Kleene-Closure操作的Petri网方法

Computing maximal Kleene closures that are embeddable in a given subword-closed language

摘要

著录项

相似文献

相关主题

期刊订阅