An introduction to the theory of formal languages and automata

An Introduction to the Theory of Formal Languages and Automata

Volumn , Issue , 2008, Pages 1-139

  Levelt, Willem J M ^a  

^a MAX PLANCK INSTITUTE FOR PSYCHOLINGUISTICS   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84945571741     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1075/z.143     Document Type: Book

References (50)

1. Bar-Hillel, Y. 1964. Language and information. Selected essays on theory and application. Reading, Mass.: Addison-Wesley.
2. Bar-Hillel, Y., Gaifman, C. & Shamir, E. 1960. On categorical and phrase structure grammars. Bull. Res. Council of Israel 9F: 1-16. (See also Bar-Hillel 1964).
3. Booth, T.L. 1969. Probability representation of formal languages. IEEE Tenth An{reversed not sign}nual Symposium on Switching and Automata Theory (November).
4. Chomsky, N. 1959a. On certain formal properties of grammars. Information and Control 2: 137-67.
5. Chomsky, N. 1959b. A note on phrase structure grammars. Information and Control 2: 393-95.
6. Chomsky, N. 1962. Context-free grammars and pushdown storage RLE Quart. Prog. Rept. No. 65. Cambridge, Mass.: MIT.
7. Chomsky, N. 1963. Formal properties of grammar. Handbook of Mathematical Psychology. R.D. Luce, R.R. Bush, & E. Galanter (eds), New York: Wiley.
8. Chomsky, N. & Miller, G.A. 1958. Finite state languages. Information and Control 1: 91-112.
9. Chomsky, N. & Miller, G.A. 1963. Introduction to the formal analysis of natu{reversed not sign}ral languages. Handbook of mathematical psychology, R.D. Luce, R. Bush, R.E. Galanter (eds), New York: Wiley.
10. Chomsky, N. & Schutzenberger, M.P. 1963. The algebraic theory of context-free languages. Computer Programming and Formal Systems, P. Braffort & D. Hirschberg, (eds), Amsterdam: North-Holland.
11. Davis, Martin. 1958. Computability and unsolvability. New York: McGraw-Hill.
12. Ellis, G.A. 1969. Probabilistic languages and automata. Rept. no. 355. Dept. Comp. Sc. University of Illinois, Urbana, Ill.
13. Evey, R.J. 1963. The theory and application of pushdown machines. Mathemati{reversed not sign}cal Linguistics and Automatic Translation (Computation Lab. Rept. NSF-10). Cambridge, Mass.: Harvard.
14. Feldman, J.A., Gips, J. Horning, J.J. & Reder, S. 1969. Grammatical complexity and inference. Techn. Rep. No. CS 125. Computer Science Dept., Stanford Univ.
15. Feller, W. 1968. An Introduction to probability theory and its applications, third edi{reversed not sign}tion. New York: Wiley.
16. Ginsburg, S. 1962. An introduction to mathematical machine theory. Reading, Mass.: Edison-Wesley.
17. Ginsburg, S. 1966. The mathematical theory of context-free languages. New York: McGraw-Hill.
18. Ginsburg, S. & Ullman, J. 1966. Ambiguity in context-free languages. J. Assoc. Comp. Mach. 13: 62-88.
19. Ginzburg, A. 1968. Algebraic theory of automata. New York: Academic Press.
20. Gold, E.M. 1967. Language identification in the limit. Information and Control 10: 441-74.
21. Greibach, S.A. 1963. The undecidability of the ambiguity problem for minimal linear grammars. Information and Control 6: 117-25.
22. Greibach, S.A. 1965. A new normal form theorem for context-free phrase struc-ture grammars. J. Ass. Comp. Mach. 12: 42-52.
23. Greibach, S.A. 1966. The unsolvability of the recognition of linear context-free lan-guages. J. Ass. Comp. Mach. 13: 582-87.
24. Grenander, U. 1967. Syntax-controlled probabilities. Rept. Division Appl. Mathem. Brown University, Providence, R.I.
25. Hopcroft, J.E. & Ullman, J.D. 1969. Formal languages and their relation to automata. Reading, Mass.: Addison-Wesley.
26. Horning, J.I. 1969. A study of grammatical inference. Technical Report CS 139 Stan-ford Artificial Intelligence Project. Stanford: Computer Science Department.
27. Huang, T. & Fu, K.S. 1971. On stochastic context-free languages. Information Sciences 3: 201-24.
28. Kleene, S.C. 1952. Introduction to metamathematics. Princeton: Van Nostrand.
29. Kleene, S.C. 1956. Representation of events in nerve nets and finite automata. Automata studies, C.E. Shannon, & J. McCarthy (eds), Princeton: Princeton University Press.
30. Knuth, D.E. 1965. On the translation of languages from left to right. Information and Control 8: 607-39.
31. Kuroda, S.Y. 1964. Classes of languages and linear-bounded automata. Information and Control 7: 201-23.
32. Landweber, P.S. 1963. Three theorems on phrase structure grammars of type 1. Information and Control 6: 131-36.
33. Levelt, W.J.M. 2009. Formal grammars in linguistics and psycholinguistics. Amsterdam & Philadelphia: John Benjamins. (Reprint in one volume of the 1974 edition published by Mouton.).
34. McCulloch, W.S. & Pitts, W. 1943. A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophysics 5: 115-33.
35. Miller, G.A. & Chomsky, N. 1957. Pattern conception. Paper for Conference on Pat-tern Detection, University of Michigan.
36. Minsky, M.L. 1967. Computation. Finite and infinite machines. Englewood Cliffs: Prentice-Hall.
37. Myhill, J. 1960. Linear bounded automata. WADD Technical Note 60-165. Wright Air Development Division, Wright-Patterson Air Force Base, Ohio
38. Nelson, R.J. 1968. Introduction to automata. New York: Wiley.
39. Newell, A., Shaw, J.C. & Simon, H.A. 1959. Report on a general problem-solving program. Information Processing. Proc. Intern.Conf. on Information Processing, Paris: UNESCO.
40. Oettinger, A. 1961. Automatic syntactic analysis and the pushdown store. Struc-ture of language and its mathematical aspects, R. Jakobson, (ed.), Providence: Amer. Math. Soc.
41. Parikh, R.J. 1961. Language generating devices. Quart. Progr. Rep. MIT Res. Lab. Electr. 60: 199-212.
42. Rabin, M.O. 1963. Probabilistic automata. Information and Control 6: 230-54.
43. Rabin, M.O. & Scott, D. 1959. Finite automata and their decision problem, IBM J. Res. 3: 115-25.
44. Salomaa, A. 1969. Theory of automata. Oxford: Pergamon Press.
45. Salomaa, A. 1973. Formal languages. NewYork: Acad. Press.
46. Solomonoff, R.J. 1958. The mechanization of linguistic learning. Proc. Second Intern. Congr. Cybernetics (Namur), 180-93.
47. Solomonoff, R.J. 1964a. A formal theory of inductive reference. Part I. Information and Control 7: 1-22.
48. Solomonoff, R.J. 1964b. A formal theory of inductive reference. Part II. Information and Control 7: 224-54.
49. Suppes, P. 1970. Probabilistic grammars for natural languages. Synthese 22: 95-116.
50. Turing, A.M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 42: 230-65.