String binding-blocking automata

DOI10.1007/3-540-45105-6_51MaRDI QIDQ4436834zbMATH OpenFDO

Authors M. Sakthi Balan

Publication date 4 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2723/27230425.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• Peptide computing -- universality and complexity
• On the universality of peptide computing
• Peptide computers
• Peptide Computing – Universality and Theoretical Model
• Binding-blocking automata

Cited in

(8)

• Peptide computers
• Incremental building in peptide computing to solve Hamiltonian path problem
• Peptide computing -- universality and complexity
• Binding-blocking automata
• Peptide Computing – Universality and Theoretical Model
• Peptide computing: a survey
• Aspects of Molecular Computing
• On the universality of peptide computing

This page was built for publication: String binding-blocking automata

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