8 citations · 11 across the 15 of their papers we have counts for
7 papers · 1 filter
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…
Derivation languages, descriptional complexity measures and decision problems of a class of flat splicing systems
Prithwineel Paul, Kumar Sankar Ray
In this paper, we associate the idea of derivation languages with flat splicing systems and compare the families of derivation languages (Szilard and control languages) of these sy…
2-tape 1-way Quantum Finite State Automata
Debayan Ganguly, Kumar Sankar Ray
1-way quantum finite state automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by 1-way quantum finite automata…