Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1)
  Models Of Computation (F.1.1) See Reviews  
Subject Descriptors:
Automata (271)
Bounded-Action Devices (78)
Computability Theory (55)
Relations Between Models (28)
Self-Modifying Machines (135)
Unbounded-Action Devices (122)
Proper Nouns:
There are no proper nouns with reviews under F.1.1.
Reviews limited to:

Reviews about "Models Of Computation (F.1.1)":
Quantum relational Hoare logic
Unruh D.  Proceedings of the ACM on Programming Languages 3(POPL): 1-31, 2019. Type: Article
Finite-state techniques: automata, transducers and bimachines
Mihov S., Schulz K.,  Cambridge University Press, New York, NY, 2019. 324 pp. Type: Book (978-1-108485-41-8)
Interconnectability of session-based logical processes
Toninho B., Yoshida N.  ACM Transactions on Programming Languages and Systems 40(4): 1-42, 2018. Type: Article
Regular language representations in the constructive type theory of Coq
Doczkal C., Smolka G.  Journal of Automated Reasoning 61(1-4): 521-553, 2018. Type: Article
Models of computation
Bruni R., Montanari U.,  Springer Publishing Company, Incorporated, New York, NY, 2017. 395 pp. Type: Book (978-3-319428-98-7)
On the uniform computational content of computability theory
Brattka V., Hendtlass M., Kreuzer A.  Theory of Computing Systems 61(4): 1376-1426, 2017. Type: Article
Languages with membership determined by single letter factors
Higgins P., Alwan S.  Theoretical Computer Science 680 15-24, 2017. Type: Article
Related Topics
F.1.1 Models Of Computation
  - Mathematical Logic
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy