Unary Watson-Crick automata
Article Type
Research Article
Publication Title
Theoretical Computer Science
Abstract
We introduce unary Watson-Crick automata and show that the set of all languages accepted by unary Watson-Crick automata is at most equal to the set of languages accepted by one counter automata and is a proper superset of the set of all regular languages.
First Page
107
Last Page
112
DOI
10.1016/j.tcs.2019.03.009
Publication Date
8-23-2019
Recommended Citation
Chatterjee, Kingshuk and Ray, Kumar Sankar, "Unary Watson-Crick automata" (2019). Journal Articles. 739.
https://digitalcommons.isical.ac.in/journal-articles/739
COinS
