|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
BERGE, C. Theorie des Graphes et ses Applications. Paris, Dunod, 1959.
|
| |
2
|
BURKS, A. W., AND WRIGHT, J. B. Theory of logical nets. Proc. IRE, 41 (1953), 1357-1365.
|
| |
3
|
BURXS, A. W., Ann CoPi, I .M . The logical design of an idealized general-purpose computer. J. Franklin Inst. 261 (1956), 299-314; 421-436.
|
| |
4
|
CHOMSKV, N. On certain formal properties of grammars. Informat. Contr. 2 (June 1959), 137-167.
|
| |
5
|
CHOMSKV, N. Three models for the description of language. IRE Trans. Informat. Theory IT-2, 3 (Sept. 1956), 113-124.
|
| |
6
|
Dxvls, M. Computability and Unsolvability. New York, McGraw-Hill, 1958.
|
| |
7
|
GORN, S. Common programming language task, FT. I, Sec. 5. Final Report AD59UR1, U.S. Army Signal Corps, Contract No. DA-36-039-sc-75047. The Moore School of Electrical Engineering, University of Pennsylvania (July, 31, 1959).
|
| |
8
|
GORN, S. Common programming language task, Ft. I. Final Report, AD60UR1, U.S. Army Signal Corps, Contract No. DA-36-039-sc-75047. The Moore School of Electrical Engineering, University of Pennsylvania (June 30, 1960).
|
 |
9
|
|
 |
10
|
|
| |
11
|
GORN, S. The treatment of ambiguity and paradox in mechanical languages. AFOSR TN-603-61, U.S. Air Force Contract No. AF-49(638)-951; The Office of Computer Research and Education, University of Pennsylvania (Apr. 1961).
|
 |
12
|
|
| |
13
|
HOHN, F. E. Boolean matrices and the design of combinational relay switching circuit. Bell System Tech. J. 34 (Jan. 1955), 177-202.
|
| |
14
|
HOHN, F. E., SESHU, S., AND AUFENKAMP, D.D. The theory of nets. IRE Trans. Electr. Comput. EC-6, 3 (1957), 154-161.
|
| |
15
|
iKLEENE, S. C. Representation of events in nerve nets and finite automata. In Automata Studies, C. E. Shannon and J. McCarthy, eds., pp. 3-41. Princeton, Princeton University Press, 1956.
|
| |
16
|
McNAuGttTON, m., AND YAMADA, H. Regular expressions and state graphs for automata. WADC TN 59-192, U.S. Air Force Contract AF 33 (616)-5886; The Moore School of Electrical Engineering, University of Pennsylvania, Report No. 60-06 (July 1, 1959).
|
| |
17
|
MEALY, G. H. Method of synthesizing sequential circuits. Bell System Tech. J. 84 (Sept. 1955), 1045-1079.
|
| |
18
|
MINSKY, M. A 6-symbol 7-state universal Turing machine. Report No. 54G-0027 Contract AF 19(604)5200, Aug. 17, 1960, Lincoln Lab., MIT
|
| |
19
|
MOORE, E. F. Gedanken-experiments on sequential machines. In Automata Studies, C. E. Shannon and J. McCarthy, eds. pp. 129-153. Princeton, Princeton University Press, 1956.
|
 |
20
|
|
 |
21
|
Peter Naur , J. W. Backus , F. L. Bauer , J. Green , C. Katz , J. McCarthy , A. J. Perlis , H. Rutishauser , K. Samelson , B. Vauquois , J. H. Wegstein , A. van Wijngaarden , M. Woodger, Report on the algorithmic language ALGOL 60, Communications of the ACM, v.3 n.5, p.299-314, May 1960
[doi> 10.1145/367236.367262]
|
| |
22
|
0ETTINGER, A. G. Automatic syntactic analysis and the pushdown store. Proc. Symposia in Applied Mathematics, American Mathematical Society, 1961.
|
| |
23
|
VEBLEN, 0. Analysis Situs. New York, American Mathematical Society, 1931.
|
| |
24
|
WILKES, M. V. Automatic Digital Computers. London, Methuen, 1957.
|
| |
25
|
BACKUS, J. W. The syntax and semantics of the proposed International Algebraic Language of the Zurich ACM- GAMM Conference. Presented at the First International Conference on Information Processing (ICIP) June 13-23, 1959 in Paris, France. International Business Machines Corp., New York, USA.
|
| |
26
|
WEGSTEIN, J. A general purpose pseudocode. Annual ACM Conf., Ann Arbor, Mich., June 1954. A more extensive bibliography and further discussion of some of these languages may be found in:
|
| |
27
|
McNaughton, R. The theory of automata-a survey. In Advances in Computers, v. 2, Franz L. Alt (ed.) New York, Academic Press, 1961.
|
|