|
 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
|
ALT, F. (Ed.) Advances in Computers (2). Acadentic Press, 1961.
|
| |
2
|
BERGE, C. The Theory of Graphs and Its Applications. Wiley, 1962.
|
| |
3
|
BIRKOFF, G., AND MACLANE, S. A. Survey of Modern Algebra. New York, Macmillan, 1953.
|
| |
4
|
BRAFFORT, P., AND HIRSCHBERG, D. (Ed.) Computer Programming and Formal Systems. North Holland, 1963.
|
| |
5
|
BUSH, GALANTER, AND LUCE. (Eds.) Handbook of Mathematical Psychology. Vol. 2, Wiley.
|
| |
6
|
CARNAP, R. The Logical Syntax of Language. Harcourt Brace, 1937.
|
| |
7
|
-----. Introduction to Symbolic Logic and Its Applications. Dover, 1958.
|
| |
8
|
CHOMSKY, N. Syntactic Structures. Mouton, 1957.
|
| |
9
|
CHURCH, A. Introduction to Mathematical Logic. Princeton U. Press, 1952.
|
| |
10
|
CURRY, H. B. A Theory of Formal Deducibility. Notre Dame, 1950.
|
| |
11
|
----. Formalist Philosophy of Mathematics. North Holland, 1951.
|
| |
12
|
----, AND FEYS, R. Combinatory Logic. Vol. 1, North Holland, 1958.
|
| |
13
|
DAVIS, M. D. Computability and Unsolvability. McGraw-Hill, 1958.
|
| |
14
|
|
| |
15
|
G~DEL, K. On Undecidable Propositions of Formal Mathematical Systems. Princeton, 1934.
|
| |
16
|
GOODMAN, R. Annual Review in Automatic Programming 2. Pergamon, 1961.
|
| |
17
|
GOODSTEIN, R. L. Recursive Number Theory. North Holland, 1957.
|
| |
18
|
HERMES, H. Aufz~hlbarkeit, Entscheidbarlceit, Berechenbarkeit. Springer, 1961.
|
| |
19
|
HILBERT, D. AND ACKERMANN, W. Principles of Mathematical Logic. New York, 1950.
|
| |
20
|
-----, AND BERNAYS, P. Grundlagen der Mathematik. Springer, 1934, 1939.
|
| |
21
|
|
| |
22
|
KLEENE, S. C. Introduction to Metamathematics. Van Nostrand, 1952.
|
| |
23
|
LANDAU, E. Grundlagen der Analysis. Akademische Verlagsgesellschaft, 1930.
|
| |
24
|
LEWIS, C. E. AND LANGFORD, C. H. Symbolic Logic. Century, 1932.
|
| |
25
|
MACDUFFER, C. Introduction to Abstract Algebra. Wiley, 1940.
|
| |
26
|
MARKOV, A. A. Theory of Algorithms. Off. of Technical Services, Dept. of Commerce, 1961.
|
| |
27
|
MARTIN, R. M. Truth and Denotation. Chicago, 1958.
|
| |
28
|
-----. Toward a Systematic Pragmatics. North Holland, 1959.
|
| |
29
|
MORRIS, C. W. Signs, Language and Behavior. Prentice-Hall, 1946.
|
| |
30
|
PETERSON, W. W. Error-Correcting Codes. Wiley-M.I.T., 1961.
|
| |
31
|
Proc. of the Symposium at the International Computation Center. Symbolic Languages in Data Processing. Gordon and Breach, 1962.
|
| |
32
|
Proc. of Symposia in Applied Mathematics, 12. Am. Math,. Soe, Providence, R. I., 1961.
|
| |
33
|
QUINE, W. V. Mathematical Logic. Morton, 1940.
|
| |
34
|
----. A System of Logistic. Cambridge, 1934.
|
| |
35
|
Recursive Function Theory. Proc. of Symposia in Pure Mathematics, 5. Am. Math. Soe., Providence, R. I., 1962.
|
| |
36
|
ROSENBLOOM, P. Introduction to Logic. Dover, 1950.
|
| |
37
|
ROSSER, J. B. Logic for Mathematicians. McGraw-Hill, N. Y., 1953.
|
| |
38
|
SHANNON, C. E., AND MCCARTHY, J. (Ed.) Automata Studies. Princeton, 1956.
|
| |
39
|
SMULLYAN, R. Theory of Formal Systems. Princeton, 1961.
|
| |
40
|
Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962.
|
| |
41
|
WHITEHEAD, A. N., AND RUSSELL, B. Principia Mathematica. Cambridge, 1910, 1912, 1913.
|
| |
1
|
BAR-HILLEL, Y., GAIFMAN, C., AND SHAMIR, E. On categorial and phrase structure grammars. Bulletin of the Research Council of Israel, 9F, 1-16, 1960.
|
| |
2
|
----, AND SHAMIR, E. Finite state languages. Bulletin of the Research Council of Israel, 8F, 155-166, 1960.
|
| |
3
|
----, PERLES, N., AND SHAMIR, E., On formal properties of simple phrase structure grammars. AD 241572, Hebrew U., Israel, 1960. Techn. Rep. No: 4. ONR No. 62558-2214.
|
| |
4
|
BAUER, F. L., AND SAMELSON, K. The cellar principle for formula translation. Proc. ICIP, Paris 59, pp. 154-155, Paris-M~nchen-London, 1960.
|
| |
5
|
B~HM, C. Macchine a indirizzi, dotate di un numero minimo di istruzioni. Rend. Ace. Naz. Lincei, 32, Serie VIII (June 1962), fasc. 6.
|
| |
6
|
----, AND JACOPINI, G. Nuove tecniche di programmazione semplificanti la sintesi di macchine universali di Turing. Rend. Acc. Nuz. Lincei, 32, Serie VIII (June 1962), fasc. 6.
|
| |
7
|
BURGE, W. H. Sorting, trees, and control. Informat. Contr. 1, 3 (1958).
|
 |
8
|
|
| |
9
|
BRZOZOWSKI, J. A. Derivatives of regular expressions.
|
| |
10
|
BURKS, A. W. The logic of fixed and growing automata. Proc. International Symposium on Switching Theory. Part I, Harvard, 1957.
|
| |
11
|
----, AND COPI, I. M. The logical design of an idealized generalpurpose computer. J. Franklin Institute 261 (1956), 299-314, 421-436.
|
| |
12
|
----, AND WRIGHT, J. B. Theory of logical nets. Proc. IRE, 41 (1953), 1357-1365.
|
| |
13
|
|
| |
14
|
----, WARREN, D. W., AND WRIGHT, J. B. An analysis of a logical machine using parenthesis-free notation. Math. Tables Other Aids to Comput. 7, 46 (April 1954), 53-57.
|
| |
15
|
---- , AND WRIGHT, J. B. Sequence generators and digital computers, Recursive Function Theory, Proc. of Symp. in Pure Math, 5. Am. Match. Soe., Providence, (1962).
|
| |
16
|
CHOMSKY, N. Three models for the description of language. Trans. on Information Theory, IRE, IT-2, No. 3, 1956, 113-124.
|
| |
17
|
----. On certain formal properties of grammars. Informal. Contr. 2, 2 (1959), 137-167. AD 221311.
|
| |
18
|
----. A note on phrase structure grammars. Informat. Contr. 2 (1959), 393-395.
|
| |
19
|
----. On the Notion "Rule of Grammar." Proc. Symposium on Applied Mathematics, 12. Am. Math. Soc. (1961).
|
| |
20
|
----. Context-free grammars and pushdown storage. Quarterly Progress Reports No. 65. Res. Lab for Electronics, M.I.T., 1962.
|
| |
21
|
----. Formal properties of grammars. To appear in Handbook of Mathematical Psychology, Vol. 2, Wiley.
|
| |
22
|
----. AND MILLER, G. A. Finite state languages. Informat. Contr. 1 (1958), 92-112.
|
| |
23
|
----, AND ----. Introduction to the formal analysis of natural languages. To appear in Handbook of Mathematical Psychology, Vol. 2, Wiley.
|
| |
24
|
|
| |
25
|
CULIK, K. Formal structure of ALGOL and simplification of its description. Symbolic Lang. in Data Proc. Gordon & Breach, 1962.
|
| |
26
|
DELEEOW, K., MOORE, E. F., SHANNON, C. E., AND SHAPIRO, N. Computability of probabalistic machines Automata Studies. Princeton, 1956.
|
| |
27
|
DIJKSTRA, E. W. An attempt to unify the constituent concepts of serial Proc, exec. Symbolic Lang. in Data Proc. Gordon & Breach, 1962.
|
| |
28
|
|
| |
29
|
FLOYD, R. W. A note on mathematical induction on phrase structure grammars. Informat. Contr. 4, 4, (Dec. 1961), 353-358.
|
| |
30
|
|
| |
31
|
On syntactic analysis and operator Precedence. Rep. No. CA-62-2, Computer Associates, Inc., Aug. 1962.
|
| |
32
|
GARDIN, J. C., AND LEVY, F. Quelques operations automatiques fond~es sur la grammaire du SYNTOL en documentation automatiques. Symbolic Lang. in Data Proc. Gordon & Breach, 1962.
|
| |
33
|
|
| |
34
|
|
| |
35
|
|
| |
36
|
----, AND HIBBARD, N. The solvability of machine mappings of regular sets to regular sets. Rep. SP 772, Systems Development Corp., April 6, 1962.
|
| |
37
|
----, AND SPANIER, E. H. Quotients of context-free languages. Rep. TM-738, Systems Development Corp. July 9, 1962.
|
| |
38
|
GIVEON, J. Lattice matrices and finite automata. Techn. Rep. No. 8, ONR Contract 62558-2214, Jerusalem, Feb. 1962.
|
| |
39
|
GLENNIE, A. E. On the syntax machine and the construction of a universal compiler. Carnegie Institute of Technology, 1960.
|
| |
40
|
G~DEL, K. Ueber Vollst~ndigkeit und Widerspruchsfreiheit, Ergebnisse eines mathematischen Kolloquiums. Heft 3, S-21-3, 1932.
|
| |
41
|
HALL, MARSHALL, JR. The word problem for semi-groups with two generators. J. Symbolic Logic 14 (1949), 115-118.
|
| |
42
|
HAMMING, R. W. Error detecting and error correcting codes. Bell System Techn. Publ. Monograph 1757 or BSTJ Vol. 29 (April 1950), 147-160.
|
| |
43
|
HOHN, F. E. Boolean matrices and the design of combinational relay switching circuits. Bell System Techn. J. 34 (Jan. 1955), 177-202.
|
| |
44
|
HUFFMAN, D. A. A Method for the construction of minimumredundancy codes. Proc. IRE 40, 9 (Sept,. 1952), 1098-1101.
|
| |
45
|
LOMBARDI, L. A. Theory of files. Proc. 1960 Eastern Joint Comput. Conf., Paper 3.3, N. Y., 1960.
|
| |
46
|
|
| |
47
|
|
| |
48
|
On the declarative control of the data flow by means of recursive functions. Symbolic Lang. in Data Proc. Gordon & Breach, 1962.
|
| |
49
|
KLEENE, S. C. Representation of events in nerve nets and finite automata. Automata Studies. Princeton, 1956.
|
| |
50
|
|
| |
51
|
---- . Computer programs for checking mathematical proofs. Recursive Function Theory. Proc. Symposia in Pure Mathematics 5, Amr. Math. Soc., Providence (1962), 219-229.
|
| |
52
|
A basis for a mathematical theory of computation. Computer Programming and Formal Systems. North Holland, 1963.
|
| |
53
|
MCNAUGHTON, R. The theory of automata, a survey. Advances in Computers 2. F. ALT (Ed.), Academic Press, 1961.
|
| |
54
|
----, AND YAMADA, H. Regular expressions and state graphs for automata. IRE Trans. EC-9 (1960), 39-57.
|
| |
55
|
MEALY, G. H. Method of synthesizing sequential circuits. Bell System Techn. J. 34 (Sept. 1955), 1045-1079.
|
| |
56
|
MINSKY, M. Selected descriptor-indexed bibliography to the literature on artificial intelligence. IRE Trans. on Human Factors in Electronics, 1951, 39-55.
|
| |
57
|
----. A 6-symbol 7-state universal Turing machine. Rep. No. 54G-0027, Contract AF 19 (604)5200, Lincoln Lab., M.I.T., Aug. 17, 1960.
|
| |
58
|
Size and structure of universal Turing machines using tag systems. Reeursive Function Theory. Proc. Symposia in Pure Mathematics, 5. Am. Math. Soc., Providence, 1962, 229-238.
|
| |
59
|
MOORE, E. F. A simplified universal Turing machine. J. ACM (1952).
|
| |
60
|
Gedanken experiments on sequential machines. Automata Studies. Princeton, 1956, 129-153.
|
| |
61
|
AND SHANNON, C. E. Reliable circuits using less reliable relays. J. Franklin Institute 262 (1956), 191-208,281-298.
|
| |
62
|
MYHILL, J. Finite automata and representation of events, in fundamental concepts in the theory of systems. WADC Techn. Rep. 57-624.
|
| |
63
|
Linear Bounded Automata. WADD Techn. Note 60-155, 1960.
|
| |
64
|
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]
|
| |
65
|
NEWELL, A., SHAW, J. C., AND SIMON, H. A. Empirical explorations of the logic theory machine : a case study in heuristics. Proc. Western Joint Comput. Conf., 1957, 218-230.
|
| |
66
|
---- AND ----. Programming the logic theory machine. Proc. Western Joint Comput. Conf. 1957 230.
|
| |
67
|
OETTINGER. A. G. Automatic syntactic analysis and the pushdown store. Proc. Symposm in Applied Mathematics, Am. Math. Soc., 1961.
|
| |
68
|
PARIKH, R. J. Language generating devices. Quarterly Prog. Rep. No. 60. Res. Lab. of Electronics. M.I.T., Jan. 1961, 199-212.
|
| |
69
|
PATTERSON, G. W., AND SARDINAS, A. A. A necessary and sufficient condition for unique decomposition of coded messages. Convention Record of the IRE. Pt 8. 1953 104-108.
|
| |
70
|
PAUL, M. A generator processor for certain formal languages. Symbolic Lang. in Data Proc. Proc. Symposium at the International Computation Center. Gordon & Breach, 1962.
|
| |
71
|
PERLES, M., RABIN, O. AND SHAMIR, E. The theory of definite automata. Techn. Rep. 6, ONR No. 62558-2214.
|
| |
72
|
PERLIS, A. J., SMITH, J. W., AND VAN ZOEREN, H. R. Internal translator (IT), a compiler for the 650. 650 Library Program, file 2.1.001, 1957.
|
| |
73
|
|
| |
74
|
POLYA. Trees. Acta Mathematica. c. 1937 (in German).
|
| |
75
|
POST, E. Formal reductions of the general combinatorial decision problem. Am. J. Math. 65 (1943), 197-215.
|
| |
76
|
----. A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52 (1946), 264-268.
|
| |
77
|
RADIN, M. O., AND SCOTT, D. Finite automata and their decision problems. IBM J. Res. Develop. 3 (1959), 114-125.
|
| |
78
|
RANKIN, B. K. III. A programmable grammar for a fragment of English for use in an information retrieval system. Rep. 7352, Nat. Bureau of Standards, 1961.
|
| |
79
|
RIGUET, J. A quick method to find matrix conductances of a switching network. Z. Mathematical Logic 6 (1960).
|
| |
80
|
----. Programmation et thdories des cat~gories. Symbolic Lang. in Data Proc. Proc. Symposium of the International Computation Center. Gordon & Breach, 1962, 83-98.
|
| |
81
|
SCH~TZENBERGER, M. P. On context-free langunges and pushdown automata. IBM Res. Paper RC-793, Aug. 21, 1962.
|
| |
82
|
----, AND CHOMSKY, N. The algebraic theory of context-free languages. Computer Programming and Formal Systems. P. BRAFFORT AND D. HIRSCHHERG (Eds.), North Holland, 1963.
|
| |
83
|
SHAMIR, E. On sequential languages. Techn. Rep. No. 7, ONR No. 62558-2214.
|
| |
84
|
TURING, A. M. On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc. 2, 42 (1937), 230-264.
|
| |
85
|
WANG, H. Toward mechanical mathematics. IBM J. Res. Develop. 4 (1960), 2-22.
|
| |
86
|
|
| |
87
|
----. Mechanical mathematics and inferential analysis. Computer Programming and Formal Systems. North Holland, 1963, 1-20.
|
| |
88
|
WARSHALL, S. An algebraic language for flowcharts. Rep. TO-B-60-33, Techn. Operations, Inc., 1960.
|
| |
89
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
K.3