Automata and concurrency
- 31 December 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 25 (3) , 221-265
- https://doi.org/10.1016/0304-3975(83)90113-5
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing MachinesSIAM Journal on Computing, 1979
- Normed Networks: Their Mathematical Theory and ApplicabilityPublished by Springer Nature ,1978
- On reduction of asynchronous systemsTheoretical Computer Science, 1977
- Some extended semaphore primitivesActa Informatica, 1977
- Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐SystemeMathematical Logic Quarterly, 1976
- Arithmetische Prädikate über einem Bereich endlicher AutomatenArchive for Mathematical Logic, 1974
- Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen BausteinenMathematical Logic Quarterly, 1973
- A comparison of two synchronizing conceptsActa Informatica, 1972
- Comments on ?A comparison of two synchronizing concepts by P.B. Hansen?Acta Informatica, 1972
- A Theory of Asynchronous Control NetworksIEEE Transactions on Computers, 1971