11 citations · 11 across the 12 of their papers we have counts for
11 papers · 1 filter
Set Augmented Finite Automata over Infinite Alphabets
Ansuman Banerjee, Kingshuk Chatterjee, Shibashis Guha
A data language is a set of finite words defined on an infinite alphabet. Data languages are used to express properties associated with data values (domain defined over a countably…
State Complexity of Reversible Watson-Crick Automata
Kingshuk Chatterjee, Debayan Ganguly, Kumar Sankar Ray
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…
Multi-head Watson-Crick quantum finite automata
Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray
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 a…
Two-way Nanoscale automata
Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray
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…
Parallel communicating one-way reversible finite automata system
Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray
In this paper, we discuss the computational power of parallel communicating finite automata system with 1-way reversible finite automaton as components. We show that unlike the mul…
Restricted deterministic Watson-Crick automata
Kingshuk Chatterjee, Kumar Sankar Ray
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 automa…
Non-regular unary language and parallel communicating Watson-Crick automata systems
Kingshuk Chatterjee, Kumar Sankar Ray
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-reg…
Multi-head Watson-Crick automata
Kingshuk Chatterjee, Kumar Sankar Ray
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…
Deterministic parallel communicating Watson-Crick automata systems
Kingshuk Chatterjee, Kumar Sankar Ray
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 dete…
Reversible Watson-Crick Automata
Kingshuk Chatterjee, Kumar Sankar Ray
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 W…
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 finit…