Automata and concurrency
From MaRDI portal
Publication:794437
DOI10.1016/0304-3975(83)90113-5zbMath0541.68035OpenAlexW2020588945MaRDI QIDQ794437
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90113-5
Related Items (13)
On a fast decomposition method in some models of concurrent computations ⋮ Second-Order Finite Automata ⋮ Construction universality in purely asynchronous cellular automata ⋮ Second-order finite automata ⋮ A physically universal Turing machine ⋮ A universal Brownian cellular automaton with 3 states and 2 rules ⋮ Fluctuation-driven computing on number-conserving cellular automata ⋮ Computing by Swarm Networks ⋮ Turing-completeness of asynchronous non-camouflage cellular automata ⋮ Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA ⋮ A uniform approach to true-concurrency and interleaving semantics for Petri nets ⋮ A defect localization scheme for cellular nanocomputers ⋮ A theory of bipolar synchronization scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some extended semaphore primitives
- On reduction of asynchronous systems
- A comparison of two synchronizing concepts
- Comments on: A comparison of two synchronizing concepts by P. B. Hansen
- Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
- Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen
- A Combinatorial Approach to Self-Correction
- Arithmetische Prädikate über einem Bereich endlicher Automaten
- Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme
- On the aggregation of preferences
- Towards a Theory of Universal Speed-Independent Modules
- A Theory of Asynchronous Control Networks
This page was built for publication: Automata and concurrency
