Background: A finite state machine manipulating information-carrying DNA strands can be used to perform autonomous molecular-scale computations at the cellular level. Results: We ...
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
Peter Schmidt-Nielsen, Kailiang Chen, Jonathan Bac...