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

DOI10.1016/J.TCS.2017.09.008MaRDI QIDQ1680552zbMATH OpenOpenAlexFDO

Authors Kingshuk Chatterjee, Kumar S. Ray

Publication date 16 November 2017

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.02070

zbMATH Keywords

multi-head finite automatanon-regular unary languagesnondeterministic Watson-Crick automataparallel communicating Watson-Crick automata systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Abstract: 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.

Recommendations

• Unary Watson-Crick automata
• Parallel communicating Watson-Crick automata systems
• On the power of parallel communicating Watson-Crick automata systems
• On the descriptional complexity of Watson-Crick automata
• scientific article; zbMATH DE number 1342112

Cites work

• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1342112 (Why is no real title available?)
• scientific article; zbMATH DE number 1390082 (Why is no real title available?)
• On the descriptional complexity of Watson-Crick automata
• On the power of parallel communicating Watson-Crick automata systems
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• Parallel communicating Watson-Crick automata systems
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata

Cited in

(3)

• On the power of parallel communicating Watson-Crick automata systems
• Unary Watson-Crick automata
• Extended Watson-Crick L Systems with Regular Trigger Languages

This page was built for publication: Non-regular unary language and parallel communicating Watson-Crick automata systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680552)