Binding-blocking automata

DOI10.1080/00207160.2013.769526zbMath1355.68146OpenAlexW1978668219MaRDI QIDQ5416433

Kamala Krithivasan, M. Sakthi Balan

Publication date: 20 May 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.769526

zbMATH Keywords

molecular computingmulti-head automatapeptide computing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the universality of peptide computing
• Hierarchies of one-way multihead automata languages
• Multihead one-way finite automata
• On 3-head versus 2-head finite automata
• On two-way multihead automata
• CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
• k + 1 Heads Are Better than k
• On 5′→3′ Sensing Watson-Crick Finite Automata

This page was built for publication: Binding-blocking automata