The following pages link to Automata and concurrency (Q794437):
Displaying 16 items.
- Fluctuation-driven computing on number-conserving cellular automata (Q454911) (← links)
- A theory of bipolar synchronization scheme (Q799113) (← links)
- Construction universality in purely asynchronous cellular automata (Q856418) (← links)
- A defect localization scheme for cellular nanocomputers (Q1031922) (← links)
- On a fast decomposition method in some models of concurrent computations (Q1083211) (← links)
- A uniform approach to true-concurrency and interleaving semantics for Petri nets (Q1274975) (← links)
- Automata of asynchronous behaviors (Q1575891) (← links)
- Automata for true concurrency properties (Q1652979) (← links)
- Second-order finite automata (Q2158302) (← links)
- A physically universal Turing machine (Q2678253) (← links)
- Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA (Q2819160) (← links)
- Computing by Swarm Networks (Q3541742) (← links)
- (Q4782713) (← links)
- Second-Order Finite Automata (Q5042226) (← links)
- Turing-completeness of asynchronous non-camouflage cellular automata (Q5918964) (← links)
- A universal Brownian cellular automaton with 3 states and 2 rules (Q6084235) (← links)