A comparison of the work done by generalized sequential machines and Turing machines
HTML articles powered by AMS MathViewer
- by Seymour Ginsburg and Gene F. Rose PDF
- Trans. Amer. Math. Soc. 103 (1962), 394-402 Request permission
References
- Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 0124208
- Seymour Ginsburg, On the reduction of superfluous states in a sequential machine, J. Assoc. Comput. Mach. 6 (1959), 259–282. MR 129095, DOI 10.1145/320964.320983
- M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3 (1959), 114–125. MR 103795, DOI 10.1147/rd.32.0114
Additional Information
- © Copyright 1962 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 103 (1962), 394-402
- MSC: Primary 02.80
- DOI: https://doi.org/10.1090/S0002-9947-1962-0138546-7
- MathSciNet review: 0138546