arXiv 1507.052822015-07cs.FL

Watson-Crick Quantum Finite Automata

Kingshuk Chatterjee, Kumar Sankar Ray

英文摘要：

1-way quantum finite automata are deterministic and reversible in nature, which greatly reduces its accepting property. In fact the set of languages accepted by 1-way quantum finite automata is a proper subset of regular languages. In this paper we replace the tape head of 1-way quantum finite automata with DNA double strand and name the model Watson-Crick quantum finite automata. The non-injective complementarity relation of Watson-Crick automata introduces non-determinism in the quantum model. We show that this introduction of non-determinism increases the computational power of 1-way Quantum finite automata significantly. We establish that Watson-Crick quantum finite automata can accept all regular languages and that it also accepts some languages not accepted by any multihead deterministic finite automata. Exploiting the superposition property of quantum finite automata we show that Watson-Crick quantum finite automata accept the language L=ww where w belongs to {a,b}*.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Restricted deterministic Watson-Crick automata

In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic Watson- Crick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, unary regular, finite, context free and context sensitive. We also show that computational power of restricted deterministic Watson- Crick automata with L in regular languages is same as that of determi…

2016-02-18cs.FL

Reversible Watson-Crick Automata

Watson-Crick automata are finite automata working on double strands. Extensive research work has already been done on non-deterministic Watson-Crick automata and on deterministic Watson-Crick automata. In this paper, we introduce a new model of Watson-Crick automata which is reversible in nature named reversible Watson-Crick automata and explore its computational power. We show even though the model is reversible and one way it accepts all regular languages and also analyze the state complexity of the above stated model with respect to non-deterministic block automata and non-deterministic fin…

2015-12-09cs.FL

Deterministic parallel communicating Watson-Crick automata systems

In this paper, we have introduced the deterministic variant of parallel communicating Watson-Crick automata systems. We show that similar to the non-deterministic version, the deterministic version can also recognise some non-regular uniletter languages. We further establish that strongly deterministic Watson-Crick automata systems and deterministic Watson-Crick automata system are incomparable in terms of their computational ability. We have also compared the computational ability of our system with multihead finite automata and parallel communicating finite automata systems.

2015-07-19cs.FL

Non-regular unary language and parallel communicating Watson-Crick automata systems

In 2006, Czeizler et.al. introduced parallel communicating Watson-Crick automata system. They showed that parallel communicating Watson-Crick automata system can accept the non-regular unary language L={a^(n^2 ),where n>1} using non-injective complementarity relation and three components. In this paper, we improve on Czeizler et.al. work by showing that parallel communicating Watson-Crick automata system can accept the same language L using just two components.

2015-10-07cs.FL

Multi-head Watson-Crick automata

Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of our model over multi-head finite automata and also show that both the deterministic and non-deterministic variant of the model can accept non-regular unary languages. We also compare our model with paralle…

2015-12-09cs.FL

State Complexity of Reversible Watson-Crick Automata

Reversible Watson-Crick automata introduced by Chatterjee et.al. is a reversible variant of an Watson-Crick automata. It has already been shown that the addition of DNA properties to reversible automata significantly increases the computational power of the model. In this paper, we analyze the state complexity of Reversible Watson-Crick automata with respect to non-deterministic finite automata. We show that Reversible Watson-Crick automata in spite of being reversible in nature enjoy state complexity advantage over non deterministic finite automata. The result is interesting because conversio…

2020-04-29cs.FL

更多相关论文收起更多论文

Multi-head Watson-Crick quantum finite automata

Watson-Crick quantum finite automata were introduced by Ganguly et.al. by combining properties of DNA and Quantum automata. In this paper we introduce a multi-head version of the above automaton. We further show that the multi-head variant is computationally more powerful than one-way multi-head reversible finite automata. In fact we also show that the multi-head variant accepts a language which is not accepted by any one-way multi-head deterministic finite automata.

2020-04-20cs.FL

Two-way Nanoscale automata

In this paper, we show the all final subclass of two-way Watson-Crick automata have the same computational power as the classical two-way Watson-Crick automata. Here we compare the computational power of two-way Watson-Crick automata and two-way Quantum finite automata and we observe that two-way Watson-Crick automata can accept a language which two-way quantum finite automata cannot accept.

2020-04-19cs.FL

Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars

This paper focuses on Watson-Crick languages inspired by DNA computing, their models, and algorithms for deciding the language membership. It analyzes a recently introduced algorithm called WK-CYK and introduces a state space search algorithm that is based on regular Breadth-first search but uses a number of optimizations and heuristics to be efficient in practical use and able to analyze longer inputs. The key parts are the heuristics for pruning the state space (detecting dead ends) and heuristics for choosing the most promising branches to continue the search. These two algorithms have been…

2022-09-08cs.FL

A New Sensing 5'-->3' Watson-Crick Automata Concept

Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. Therefore, it has two reading heads. While in traditional WK automata both heads read the whole input in the same physical direction, in 5'->3' WK automata the heads start from the two extremes and read the input in opposite direction. In sensing 5'->3' WK automata the process on the input is finished when the heads meet. Since the heads of a WK automaton may read longer strings in a transition, in previous models a so-called sensing parameter took care for the proper meeting of the heads (not all…

2017-08-22cs.FL

单词与语言的Watson-Crick共轭

Watson-Crick conjugates of words and languages

本研究引入结合DNA互补性的Watson-Crick（$\ heta$-）共轭概念，探究其单词层面性质、语言层面定义与封闭性、迭代形式及无$\ heta$-共轭语言的可判定性问题，拓展了经典共轭理论。

2025-08-27cs.FLmath.CO

接受项链（Necklaces）的5'->3' Watson-Crick自动机

5' -> 3' Watson-Crick Automata accepting Necklaces

本文研究接受代表环状DNA的项链输入的5'->3' Watson-Crick自动机，提出弱、强两种接受模式，分析其语言类性质并给出受限变体的层次结果。

2024-09-11cs.FL

Quasi-deterministic 5' -> 3' Watson-Crick Automata

Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. A double stranded DNA molecule contains two strands, each having a 5' and a 3' end, and these two strands together form the molecule with the following properties. The strands have the same length, their 5' to 3' directions are opposite, and in each position, the two strands have nucleotides that are complement of each other (by the Watson-Crick complementary relation). Consequently, WK automata have two reading heads, one for each strand. In traditional WK automata both heads read the whole input…

2022-08-31cs.FL

定义任意机器人的克里克-富兰克林-沃森基因（等价于有限状态机），并定义附加到每个基因的香农遗传代码；同时定义任意正则极大前缀码的克罗恩-罗兹复杂度

Defining the Crick-Franklin-Watson genes of any robot (equals a finite state machine) and defining the Shannon genetic code attached to each gene. We also define the Krohn-Rhodes complexity of any regular maximal prefix code

University of California, Berkeley（加州大学伯克利分校）

本文探讨数学三大支柱的关联，证明克罗恩-罗兹复杂度c可判定，揭示复杂度c基本引理与马尔可夫链相关理论及有限自动机基因的意外联系，还定义了机器人基因、香农遗传代码及正则极大前缀码的克罗恩-罗兹复杂度

2026-09-01cs.FLmath.PR

Theta palindromes in theta conjugates

A DNA string is a Watson-Crick (WK) palindrome when the complement of its reverse is equal to itself. The Watson-Crick mapping $θ$ is an involution that is also an antimorphism. $θ$-conjugates of a word is a generalisation of conjugates of a word that incorporates the notion of WK-involution $θ$. In this paper, we study the distribution of palindromes and Watson-Crick palindromes, also known as $θ$-palindromes among both the set of conjugates and $θ$-conjugates of a word $w$. We also consider some general properties of the set $C_θ(w)$, i.e., the set of $θ$-conjugates of a word $w$, and charac…

2020-08-01cs.DMcs.FL

2detLIN语言的一种Myhill-Nerode型刻画

A Myhill-Nerode Type Characterization of 2detLIN Languages

本文基于线性自动机模型，利用带前缀-后缀对的Myhill-Nerode型等价类刻画2detLIN语言类，并证明有限类刻画需满足完备性且不含交叉对。

2025-07-21cs.DMcs.DScs.FL