Keywords
Computer scienceAutomatonProgramming languageComputationTheoretical computer scienceAutomata theory
Related Publications
Logical Reversibility of Computation
The usual general-purpose computing automaton (e.g., a Turing machine) is logically irreversible—its transition function lacks a single-valued inverse. Here it is shown that suc...
Theorems on factorization and primality testing
1. Introduction . This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n o...
Communication and Concurrency
Foreword. 1. Modelling Communication. 2. Basic Definitions. 3. Equational laws and Their Application. 4. Strong Bisimulation and Strong Equivalence. 5. Bisimulation and Observat...
Publication Info
- Year
- 1980
- Type
- article
- Volume
- 5
- Issue
- 3-4
- Pages
- 191-192
- Citations
- 6836
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
6836
OpenAlex
Cite This
(1980).
Introduction to automata theory, languages, and computation.
Computer Languages
, 5
(3-4)
, 191-192.
https://doi.org/10.1016/0096-0551(80)90011-9
Identifiers
- DOI
- 10.1016/0096-0551(80)90011-9