Pages that link to "Item:Q5199992"
From MaRDI portal
The following pages link to Computational Aspects of Asynchronous Cellular Automata (Q5199992):
Displaying 9 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness (Q269781) (← links)
- Computation of functions on \(n\) bits by asynchronous clocking of cellular automata (Q272766) (← links)
- Asynchronous cellular automata for pomsets (Q1583242) (← links)
- Computation by asynchronously updating cellular automata (Q1777751) (← links)
- On the complexity of asynchronous freezing cellular automata (Q2051787) (← links)
- ON ASYNCHRONOUS CELLULAR AUTOMATA (Q3373085) (← links)
- Fundamentals of Computation Theory (Q5492957) (← links)
- Synchronism versus asynchronism in monotonic Boolean automata networks (Q6062004) (← links)