Unary Watson-Crick automata
Theoretical Computer Science
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.
Chatterjee, Kingshuk and Ray, Kumar Sankar, "Unary Watson-Crick automata" (2019). Journal Articles. 739.