12th European Summer School of Logic, Language and Information ESSLLI’2000,
Birmingham, August 6-18, 2000
Formal Grammars
Carlos Martín-Vide (Rovira i Virgili University, Tarragona, Spain)
cmv@astor.urv.es
BASIC BOOKS
[1] Karhumäki, J., H.A. Maurer, G. Paun & G. Rozenberg, eds.
(1999), Jewels are forever. Springer, Berlin.
[2] Kolb, H.-P. & U. Moennich, eds. (1999), The mathematics of
syntactic structure: trees and their logics. Mouton de Gruyter, Berlin.
[3] Atallah, M.J., ed. (1998), CRC handbook of algorithms and theory
of computation. CRC, Boca Raton, FL.
[4] Paun, G., G. Rozenberg & A. Salomaa (1998), DNA computing:
new computing paradigms. Springer, Berlin.
[5] Paun, G. (1997), Marcus contextual grammars. Kluwer,
Dordrecht.
[6] Rozenberg, G. & A. Salomaa, eds. (1997), Handbook of formal
languages, 3 vols. Springer, Berlin.
[7] Dassow, J., G. Rozenberg & A. Salomaa, eds. (1996),
Developments in language theory 2: at the crossroads of
mathematics, computer science and biology. World Scientific,
Singapore.
[8] Linz, P. (1990), An introduction to formal languages and
automata. D.C. Heath, Lexington, MA. (2nd ed., 1996.)
[9] Kelley, D. (1995), Automata and formal languages: an
introduction. Prentice-Hall, Englewood Cliffs, NJ.
[10] Paun, G., ed. (1995), Artificial life: grammatical models. Black
Sea University Press, Bucharest.
[11] Paun, G., ed. (1995), Mathematical linguistics and related
topics. Editura Academiei Române, Bucharest.
[12] Csuhaj-Varjú, E., J. Dassow, J. Kelemen & G. Paun (1994),
Grammar systems: a grammatical approach to distribution and
cooperation. Gordon & Breach, London.
1
[13] Davis, M.D., R. Sigal & E.J. Weyuker (1983), Computability,
complexity, and languages: fundamentals of theoretical computer
science. Academic Press, San Diego, CA. (2nd ed., 1994.)
[14] Floyd, R.W. & R. Beigel (1994), The language of machines: an
introduction to computability and formal languages. Computer
Science Press, Rockville, MD.
[15] Ito, M. & H. Jürgensen, eds. (1994), Words, languages and
combinatorics 2. World Scientific, Singapore.
[16] Papadimitriou, C.H. (1994), Computational complexity. AddisonWesley, Reading, MA.
[17] Paun, G., ed. (1994), Mathematical aspects of natural and
formal languages. World Scientific, Singapore.
[18] Rozenberg, G. & A. Salomaa (1994), Cornerstones of
undecidability. Prentice-Hall, New York, NY.
[19] Rozenberg, G. & A. Salomaa, eds. (1994), Developments in
language theory: at the crossroads of mathematics, computer science
and biology. World Scientific, Singapore.
[20] Ito, M., ed. (1992), Words, languages, and combinatorics.
World Scientific, Singapore.
[21] Howie, J.M. (1991), Automata and languages. Oxford University
Press, Oxford.
[22] Révész, G.E. (1983), Introduction to formal languages.
McGraw-Hill, New York, NY. (2nd ed.: Dover, New York, NY, 1991.)
[23] Rosen, K.H. (1988), Discrete mathematics and its applications.
McGraw-Hill, New York, NY. (2nd ed., 1991.)
[24] Shyr, H.J. (1991), Free monoids and languages. Hon Min,
Taichung.
[25] Leeuwen, J. van, ed. (1990), Handbook of theoretical computer
science, 2 vols. North-Holland/MIT Press, Amsterdam/Cambridge,
MA.
[26] Partee, B.H., A.G.B. ter Meulen & R.E. Wall (1990),
Mathematical methods in linguistics. Kluwer, Dordrecht.
2
[27] Brookshear, J.G. (1989), Theory of computation: formal
languages, automata, and complexity. Benjamin/Cummings,
Redwood City, CA.
[28] Carroll, J. & D. Long (1989), Theory of finite automata.
Prentice-Hall, Englewood Cliffs, NJ.
[28] Dassow, J. & G. Paun (1989), Regulated rewriting in formal
language theory. Springer, Berlin.
[29] Drobot, V. (1989), Formal languages and automata theory.
Computer Science Press, Rockville, MD.
[30] Gurari, E. (1989), An introduction to the theory of computation.
Computer Science Press, New York, NY.
[31] Balcázar, J.L., J. Díaz & J. Gabarró (1988, 1990), Structural
complexity, 2 vols. Springer, Berlin.
[32] Sippu, S. & E. Soisalon-Soininen (1988, 1990), Parsing theory,
2 vols. Springer, Berlin.
[33] Moll, R.N., M.A. Arbib & A.J. Kfoury (1988), An introduction to
formal language theory. Springer, Berlin.
[34] Nijholt, A. (1988), Computers and languages: theory and
practice. North-Holland, Amsterdam.
[35] Sudkamp, T.A. (1988), Languages and machines. AddisonWesley, Reading, MA.
[36] Baudot, J. (1987), Introduction aux grammaires formelles.
Sodilis, Montréal, QC.
[37] Savitch, W.J., E.W. Bach, W. Marsh & G. Safran-Naveh, eds.
(1987), The formal complexity of natural language. Reidel, Dordrecht.
[38] Wood, D. (1987), Theory of computation. John Wiley, New York,
NY.
[39] Kuich, W. & A. Salomaa (1986), Semirings, automata,
languages. Springer, Berlin.
[40] Salomaa, A. (1985), Computation and automata. Cambridge
University Press, Cambridge.
[41] Brauer, W. (1984), Automatentheorie. Teubner, Stuttgart.
3
[42] Gécseg, F. & M. Steinby (1984), Tree automata. Akadémiai
Kiadó, Budapest.
[43] Paun, G. (1984), Probleme actuale în teoria limbajelor formale.
Editura Stiintifica si Enciclopedica, Bucuresti.
[44] Pin, J.-E. (1984), Variétés de langages formels. Masson, Paris.
(Engl. transl.: Varieties of formal languages. Plenum, Oxford, 1986.)
[45] Bavel, Z. (1983), Introduction to the theory of automata.
Reston, Reston, VA.
[46] Lothaire, M., ed. (1983), Combinatorics on words. AddisonWesley, Reading, MA.
[47] McNaughton, R. (1982), Elementary computability, formal
languages, and automata. Prentice-Hall, Englewood Cliffs, NJ.
[48] Reisig, W. (1982), Petri nets: an introduction. Springer, Berlin.
[49] Lewis, H.R. & C.H. Papadimitriou (1981), Elements of the theory
of computation. Prentice-Hall, Englewood Cliffs, NJ.
[50] Salomaa, A. (1981), Jewels of formal language theory.
Computer Science Press, Rockville, MD.
[51] Book, R.V., ed. (1980), Formal language theory: perspectives
and open problems. Academic Press, New York, NY.
[52] Cutland, N.J. (1980), Computability: an introduction to
recursive function theory. Cambridge University Press, Cambridge.
[53] Nijholt, A. (1980), Context-free grammars: covers, normal
forms and parsing. Springer, Berlin.
[54] Rozenberg, G. & A. Salomaa (1980), The mathematical theory
of L systems. Academic Press, New York, NY.
[55] Wood, D. (1980), Grammar and L forms: an introduction.
Springer, Berlin.
[56] Berstel, J. (1979), Transductions and context-free languages.
Teubner, Stuttgart.
[57] Hopcroft, J.E. & J.D. Ullman (1979), Introduction to automata
theory, languages, and computation. Addison-Wesley, Reading, MA.
4
[58] Denning, P.J., J.B. Dennis & J.E. Qualitz (1978), Machines,
languages, and computation. Prentice-Hall, Englewood Cliffs, NJ.
[59] Harrison, M.A. (1978), Introduction to formal language theory.
Addison-Wesley, Reading, MA.
[60] Salomaa, A. & M. Soittola (1978), Automata-theoretic aspects
of formal power series. Springer, Berlin.
[61] Aho, A.V. & J.D. Ullman (1977), Principles of compiler design.
Addison-Wesley, Reading, MA.
[62] Ginsburg, S. (1975), Algebraic and automata-theoretic
properties of formal languages. North-Holland, Amsterdam.
[63] Herman, G.T. & G. Rozenberg (1975), Developmental systems
and languages. North-Holland, Amsterdam.
[64] Eilenberg, S. (1974, 1976), Automata, languages, and
machines, 2 vols. Academic Press, New York, NY.
[65] Brainerd, W.S. & L.H. Landweber (1974), Theory of
computation. John Wiley, New York, NY.
[66] Levelt, W.J.M. (1974), Formal grammars in linguistics and
psycholinguistics, 3 vols. Mouton, The Hague.
[67] Palma, A. de, ed. (1974), Linguaggio e sistemi formali. Teorie e
metodi della lingüística matematica da Carnap a Chomsky. Giulio
Einaudi, Torino.
[68] Kimball, J.P. (1973), The formal theory of grammar. PrenticeHall, Englewood Cliffs, NJ.
[69] Salomaa, A. (1973), Formal languages. Academic Press, New
York, NY.
[70] Gécseg, F. & I. Péak (1972), Algebraic theory of automata.
Akadémiai Kiadó, Budapest.
[71] Gross, M. (1972), Mathematical models in linguistics. PrenticeHall, Englewood Cliffs, NJ.
[72] Hughes, M. (1972), Initiation mathématique aux grammaire
formelles. Larousse, Paris.
[73] Aho, A.V. & J.D. Ullman (1971, 1973), The theory of parsing,
translation and compiling, 2 vols. Prentice Hall, Englewood Cliffs, NJ.
5
[74] Brainerd, B. (1971), Introduction to the mathematics of
language study. Elsevier, New York, NY.
[75] Paz, A. (1971), Introduction to probabilistic automata.
Academic Press, New York, NY.
[76] Gross, M. & A. Lentin (1967), Notions sur les grammaires
formelles. Gauthier-Villars, Paris. (2nd ed., 1970.)
[77] Arbib, M.A. (1969), Theories of abstract automata. PrenticeHall, Englewood Cliffs, NJ.
[78] Maurer, H.A. (1969), Theoretische Grundlagen der
Programmiersprachen, Hochschultaschenbücher 404.
Bibliographisches Institut.
[79] Salomaa, A. (1969), Theory of automata. Pergamon, Oxford.
[80] Arbib, M.A., ed. (1968), Algebraic theory of machines,
languages and semigroups. Academic Press, New York, NY.
[81] Engeler, E. (1968), Formal languages. Markham, Chicago, IL.
[82] Ginzburg, A. (1968), Algebraic theory of automata. Academic
Press, New York, NY.
[83] Nelson, R.J. (1968), Introduction to automata. John Wiley, New
York, NY.
[84] Marcus, S. (1967), Algebraic linguistics: analytical models.
Academic Press, New York, NY.
[85] Minsky, M.L. (1967), Computation: finite and infinite machines.
Prentice-Hall, Englewood Cliffs, NJ.
[86] Rogers, H., Jr. (1967), Theory of recursive functions and
effective computability. McGraw-Hill, New York, NY.
[87] Caianiello, E.R., ed. (1966), Automata theory. Academic Press,
New York, NY.
[88] Ginsburg, S. (1966), The mathematical theory of context-free
languages. McGraw-Hill, New York, NY.
[89] Davis, M.D., ed. (1965), The undecidable: basic papers on
undecidable propositions, unsolvable problems and computable
functions. Raven, New York, NY.
6
[90] Hermes, H. (1961), Aufzählbarkeit, Entscheidbarkeit,
Berechenbarkeit. Einführung in die Theorie der rekursiven
Funktionen. Springer, Berlin. (2nd ed., 1965.) (Engl. transl.:
Enumerability, decidability, computability: an introduction to the
theory of recursive functions. Springer, Berlin, 1965; 2nd ed., 1969.)
[91] Marcus, S. (1964), Gramatici si automate finite. Editura
Academiei R.S.R., Bucuresti.
[92] Gill, A. (1962), Introduction to the theory of finite-state
machines. McGraw-Hill, New York, NY.
[93] Ginsburg, S. (1962), An introduction to mathematical machine
theory. Addison-Wesley, Reading, MA.
[94] Smullyan, R.M. (1961), Theory of formal systems. Princeton
University Press, Princeton, NJ.
[95] Davis, M.D. (1958), Computability and unsolvability. Dover,
New York, NY.
COMPLEMENTARY BOOKS
[96] Martín-Vide, C., ed. (1999), Issues in mathematical linguistics.
John Benjamins, Amsterdam.
[97] Wilson, R.A. & F.C. Keil, eds. (1999), The MIT encyclopedia of
the cognitive sciences. MIT Press, Cambridge, MA.
[98] Martín Vide, C., ed. (1998), Mathematical and computational
analysis of natural language. John Benjamins, Amsterdam.
[99] Paun, G., ed. (1998), Computing with bio-molecules: theory
and experiments. Springer, Singapore.
[100] Varile, G. & A. Zampolli, eds. (1998), Survey of the state of
the art in human language technology. Cambridge University Press,
Cambridge.
[101] Dawson, J.W. (1997), Logical dilemmas: the life and work of
Kurt Gödel. A.K. Peters, Wellesley, MA.
[102] Paun, G. & A. Salomaa, eds. (1997), New trends in formal
languages: control, cooperation, and combinatorics. Springer, Berlin.
[103] Tucker, A., ed. (1997), The computer science and engineering
handbook. CRC Press, Boca Raton, FL.
7
[104] Collado-Vides, J., B. Magasanik & T.F. Smith, eds. (1996),
Integrative approaches to molecular biology. MIT Press, Cambridge,
MA.
[105] Sikkel, K. (1996), Parsing schemata: a framework for
specification and analysis of parsing algorithms. Springer, Berlin.
[106] Bouchon-Meunier, B., R. Yager & L.A. Zadeh, eds. (1995),
Fuzzy logic and soft computing. World Scientific, Singapore.
[107] Diekert, V. & G. Rozenberg, eds. (1995), The book of traces.
World Scientific, Singapore.
[108] Graham, R.L., M. Grötschel & L. Lovász, eds. (1995),
Handbook of combinatorics, 2 vols. North-Holland/MIT Press,
Amsterdam/Cambridge, MA.
[109] Abiteboul, S. & E. Shamir, eds. (1994), Automata, languages
and programming. Springer, Berlin.
[110] Karhumäki, J., H.A. Maurer & G. Rozenberg, eds. (1994),
Results and trends in theoretical computer science. Springer, Berlin.
[111] Kruse, R., J. Gebhardt & F. Klawonn (1994), Foundations of
fuzzy systems. John Wiley, Chichester.
[112] Martín Vide, C., ed. (1994), Current issues in mathematical
linguistics. North-Holland, Amsterdam.
[113] Puterman, M.L. (1994), Markov decision processes. John
Wiley, New York, NY.
[114] Savitch, W.J. & W. Zadrozny, eds. (1994), Mathematics of
language, Linguistics and Philosophy, 17.6. Kluwer, Dordrecht.
[115] Hunter, L., ed. (1993), Artificial intelligence and molecular
biology. AAAI Press/MIT Press, Menlo Park, CA/Cambridge, MA.
[116] Keenan, E.L. & U. Mönnich (1993), Introduction to
mathematical analysis of natural language, Fifth European Summer
School in Logic, Language and Information, Lisboa.
[117] Li, M. & P. Vitanyi (1993), An introduction to Kolmogorov
complexity and its applications. Springer, Berlin.
[118] Snepscheut, J.L.A. van de (1993), What computing is all
about. Springer, Berlin.
8
[119] Zadrozny, W., A. Manaster Ramer & M.A. Moshier, eds.
(1993), Mathematics of language, Annals of Mathematics and
Artificial Intelligence, 8.1-2. J.C. Baltzer, Basel.
[120] Abramsky, S., D.M. Gabbay & T.S.E. Maibaum, eds. (19921995), Handbook of logic in computer science, 4 vols. Clarendon,
Oxford.
[121] Rozenberg, G. & A. Salomaa, eds. (1992), Lindenmayer
systems: impacts on theoretical computer science, computer graphics
and developmental biology. Springer, Berlin.
[122] Turing, A.M. (1992), Mechanical intelligence, ed. D.C. Ince.
North-Holland, Amsterdam.
[123] Cohen, D.I.A. (1986), Introduction to computer theory. John
Wiley, New York, NY. (2nd ed., 1991.)
[124] Forrest, S., ed. (1991), Emergent computation. MIT Press,
Cambridge, MA.
[125] Jorrand, P. & J. Kelemen, eds. (1991), Fundamentals of
artificial intelligence research. Springer, Berlin.
[126] Nivat, M. & A. Podelski, eds. (1991), Tree automata and
languages: definability and recognizability of sets ot trees. NorthHolland, Amsterdam.
[127] Potter, M.D. (1991), Sets: an introduction. Clarendon, Oxford.
[128] Sells, P., S.M. Shieber & T. Wasow, eds. (1991), Foundational
issues in natural language processing. MIT Press, Cambridge, MA.
[129] Börger, E. (1990), Computability, complexity, logic. NorthHolland, Amsterdam.
[130] Cormen, T.H., C.E. Leiserson & R.L. Rivest (1990),
Introduction to algorithms. MIT Press, Cambridge, MA.
[131] Davey, B.A. & H.A. Priestley (1990), Introduction to lattices
and order. Cambridge University Press, Cambridge.
[132] Boolos, G.S. & R.C. Jeffrey (1974), Computability and logic.
Cambridge University Press, Cambridge. (3rd ed., 1989.)
[133] Mateescu, A. & D. Vaida (1989), Discrete mathematical
structures: applications. Editura Academiei R.S.R., Bucuresti.
9
[134] Berstel, J. & C. Reutenauer (1988), Rational series and their
languages. Springer, Berlin.
[135] Hamilton, A.G. (1988), Logic for mathematicians, 2nd ed.
Cambridge University Press, Cambridge.
[136] Herken, R., ed. (1988), The universal Turing machine. Oxford
University Press, Oxford.
[137] Markov, A.A. & N.M. Nagorny (1988), The theory of
algorithms. Kluwer, Dordrecht.
[138] Autebert, J.M. (1987), Langages algébriques. Masson, Paris.
[139] Harel, D. (1987), Algorithmics: the spirit of computing.
Addison-Wesley, Wokingham.
[140] Manaster Ramer, A., ed. (1987), Mathematics of language.
John Benjamins, Amsterdam.
[141] Soare, R.I. (1987), Recursively enumerable sets and degrees:
the study of computable functions and computably generated sets.
Springer, Berlin.
[142] Gödel, K. (1986, 1990, 1995), Collected works, 3 vols. Oxford
University Press, Oxford.
[143] Aho, A.V., R. Sethi & J.D. Ullman (1986), Compilers:
principles, techniques, and tools. Addison-Wesley, Reading, MA.
[144] Kuich, W. & A. Salomaa (1986), Formal power series and
languages. Springer, Berlin.
[145] Rozenberg, G. & A. Salomaa, eds. (1986), The book of L.
Springer, Berlin.
[146] Wolfram, S. (1986), Theory and applications of cellular
automata. World Scientific, Singapore.
[147] Apostolico, A. & Z. Galil, eds. (1985), Combinatorial
algorithms on words. Springer, Berlin.
[148] Brookshear, J.G. (1985), Computer science: a survey.
Addison-Wesley, Reading, MA.
[149] Grimaldi, R.R. (1985), Discrete and combinatorial
mathematics: an applied introduction. Addison-Wesley, Reading, MA.
10
[150] Klenk, U., ed. (1985), Kontextfreie Syntaxen und verwandte
Systeme. Max Niemeyer, Tübingen.
[151] Manna, S. & R. Waldinger (1985), The logical basis for
computer programming 1: Deductive reasoning. Addison-Wesley,
Reading, MA.
[152] Hrbacek, K. & T. Jech (1984), Introduction to set theory, 2nd
ed. Marcel Dekker, New York, NY.
[153] Skowron, A., ed. (1984), Computation theory. Springer,
Berlin.
[154] Garey, M.R. & D.S. Johnson (1979), Computers and
intractability: a guide to the theory of NP-completeness. W.H.
Freeman, San Francisco, CA. (2nd ed., 1983.)
[155] Hodges, A. (1983), Alan Turing: the enigma. Hutchinson,
London. (Repr.: Vintage, London, 1992.)
[156] Papadimitriou, C.H. & K. Steiglitz (1982), Combinatorial
optimization. Prentice-Hall, Englewood Cliffs, NJ.
[157] Paun, G. (1982), Gramatici contextuale. Editura Academiei
R.S.R., Bucuresti.
[158] Marcus, S., ed. (1981, 1983), Contextual ambiguities in
natural and artificial languages, 2 vols. Communication and
Cognition, Ghent.
[159] Beckman, F.S. (1981), Mathematical foundations of
programming. Addison-Wesley, Menlo Park, CA.
[160] Paun, G. (1981), Gramatici matriciale. Editura Stiintifica si
Enciclopedica, Bucuresti.
[161] Drake, F.R. & S.S. Wainer, eds. (1980), Recursion theory: its
generalisations and applications. Cambridge University Press,
Cambridge.
[162] Klenk, U. (1980), Formale Sprachen. Mit Anwendungen auf die
Beschreibung natürlicher Sprachen. Max Niemeyer, Tübingen.
[163] Kunen, K. (1980), Set theory: an introduction to independence
proofs. North-Holland, Amsterdam.
11
[164] Moschovakis, Y.N. (1980), Descriptive set theory. NorthHolland, Amsterdam.
[165] Paun, G. (1980), Mecanisme generative ale proceselor
economice. Editura Technica, Bucuresti.
[166] Dauben, J.W. (1979), Georg Cantor: his mathematics and
philosophy of the infinite. Harvard University Press, Cambridge, MA.
[167] Hofstadter, D.R. (1979), Gödel, Escher, Bach: an eternal
golden braid. Basic Books, New York, NY.
[168] Lallement, G. (1979), Semigroups and combinatorial
applications. John Wiley, New York, NY.
[169] Wilson, R.J. (1979), Introduction to graph theory. Academic
Press, New York, NY.
[170] Machtey, M. & P. Young (1978), An introduction to the general
theory of algorithms. North-Holland, Amsterdam.
[171] Marcus, S., ed. (1978), La sémiotique formelle du folklore.
Klincksieck, Paris.
[172] Partee, B.H. (1978), Foundations of mathematics for
linguistics. Greylock, Harrisburg, PA.
[173] Smullyan, R.M. (1978), What is the name of this book?
Prentice-Hall, Englewood Cliffs, NJ.
[174] Karpinski, M., ed. (1977), Fundamentals of computation
theory. Springer, Berlin.
[175] Aho, A.V., J.E. Hopcroft & J.D. Ullman (1974), The design and
analysis of computer algorithms. Addison-Wesley, Reading, MA.
[176] Bobrow, L. & M.A. Arbib (1974), Discrete mathematics:
applied algebra for computer and information science. W.B.
Saunders, Philadelphia, PA.
[177] Daly, R.T. (1974), Applications of the mathematical theory of
linguistics. Mouton, The Hague.
[178] Kaufmann, A. (1973-1977), Introduction à la théorie des sousensembles flous à l’usage des ingénieurs, 4 vols. Masson, Paris.
[179] Fraenkel, A.A., Y. Bar-Hillel & A. Levy (1958), Foundations of
set theory. North-Holland, Amsterdam. (2nd ed., 1973.)
12
[180] Gross, M., M. Halle & M.P. Schützenberger, eds. (1973), The
formal analysis of natural languages. Mouton, The Hague.
[181] Knuth, D. (1973), The art of computer programming 1:
Fundamental algorithms. Addison-Wesley, Reading, MA.
[182] Trakhtenbrot, B.A. & Y.M. Barzdin (1973), Finite automata.
North-Holland, Amsterdam.
[183] Wall, R.E. (1972), Introduction to mathematical linguistics.
Prentice-Hall, Englewood Cliffs, NJ.
[184] Boucher, C. (1971), Leçons sur la théorie des automates
mathématiques. Springer, Berlin.
[185] Claus, V. (1971), Stochastische Automaten. Teubner,
Stuttgart.
[186] Conway, J.H. (1971), Regular algebra and finite machines.
Chapman & Hall, London.
[187] Deussen, P. (1971), Halbgruppen und Automaten. Springer,
Berlin.
[188] Kohavi, Z. & A. Paz, eds. (1971), Theory of machines and
computations. Academic Press, New York, NY.
[189] MacLane, S. (1971), Categories for the working
mathematician. Springer, Berlin.
[190] McNaughton, R. & S. Papert (1971), Counter-free automata.
MIT Press, Cambridge, MA.
[191] Shoenfield, J.R. (1971), Degrees of unsolvability. NorthHolland, Amsterdam.
[192] Bar-Hillel, Y., ed. (1970), Mathematical logic and foundations
of set theory. North-Holland, Amsterdam.
[193] Bartholomes, F. & G. Hotz (1970), Homomorphismen und
Reduktionen linearer Sprachen. Springer, Berlin.
[194] Bourbaki, N. (1970), Éléments de mathématique. Théorie des
ensembles. Hermann, Paris.
[195] Burks, A.W. (1970), Essays on cellular automata. University of
Illinois Press, Urbana, IL.
13
[196] Gladkij, A.V. (1970), Leçons de linguistique mathématique.
Dunod, Paris.
[197] Kohavi, Z. (1970), Switching and finite automata theory.
McGraw-Hill, New York, NY.
[198] Ginsburg, S., S. Greibach & J.E. Hopcroft (1969), Studies in
abstract families of languages. American Mathematical Society,
Providence, RI.
[199] Harary, F. (1969), Graph theory. Addison-Wesley, Reading,
MA.
[200] Harrison, M.A. (1969), Lectures on linear sequential machines.
Academic Press, New York, NY.
[201] Hopcroft, J.E. & J.D. Ullman (1969), Formal languages and
their relation to automata. Addison-Wesley, Reading, MA.
[202] Quine, W.v.O. (1963), Set theory and its logic. Harvard
University Press, Cambridge, MA. (2nd ed., 1969.)
[203] Codd, E.F. (1968), Cellular automata. Academic Press, New
York, NY.
[204] Hennie, F.C. (1968), Finite-state models for logical machines.
John Wiley, New York, NY.
[205] Schütt, D. (1968), Überblick über die algebraischen Theorien
in der Automatentheorie. Gesellschaft für Mathematik und
Datenverarbeitung, Bonn.
[206] Booth, T.L. (1967), Sequential machines and automata theory.
John Wiley, New York, NY.
[207] Hart, J.F. & S. Takasu, eds. (1967), Systems and computer
science. University of Toronto Press, Toronto, ON.
[208] Cohen, P.J. (1966), Set theory and the continuum hypothesis.
John Benjamins, New York, NY.
[209] Hartmanis, J. & R.E. Stearns (1966), Algebraic structure
theory of sequential machines. Prentice-Hall, Englewood Cliffs, NJ.
[210] Marcus, S., E. Nicolau & S. Stati (1966), Introducere în
lingüistica matematica. Editura Stiintifica, Bucuresti.
14
[211] Neumann, J. von (1966), The theory of self-reproducing
automata, ed. A.W. Burks. University of Illinois Press, Urbana, IL,
1996.
[212] Harrison, M.A. (1965), Introduction to switching and automata
theory. McGraw-Hill, New York, NY.
[213] Halmos, P.R. (1964), Naïve set theory. D. Van Nostrand,
Princeton, NJ.
[214] Moore, E.F., ed. (1964), Sequential machines: selected
papers. Addison-Wesley, Reading, MA.
[215] Luce, R.D., R.R. Bush & E. Galanter, eds. (1963), Handbook of
mathematical psychology. John Wiley, New York, NY.
[216] Trakhtenbrot, B.A. (1963), Algorithms and automatic
computing machines. Heath, Boston, MA.
[217] several authors (1962), Mathematical theory of automata.
Polytechnic Press, New York, NY.
[218] Hockett, C.F. (1962), Language, mathematics, and linguistics.
Mouton, The Hague.
[219] Culbertson, J.T. (1958), Mathematics and logic for digital
devices. D. Van Nostrand, Princeton, NJ.
[220] Curry, H.B. & R. Feys (1958), Combinatory logic. NorthHolland, Amsterdam.
[221] Shannon, C.E. & J. McCarthy, eds. (1956), Automata studies.
Princeton University Press, Princeton, NJ.
[222] Kleene, S.C. (1952), Introduction to metamathematics. NorthHolland, Amsterdam.
JOURNALS
[223] Acta Cybernetica
[224] Acta Informatica
[225] Annals of the University of Bucharest: Series MathematicsInformatics
[226] BioSystems
15
[227] Bulletin of the American Mathematical Society
[228] Bulletin of the European Association for Theoretical Computer
Science
[229] Communications of the Association for Computing Machinery
[230] Computational Intelligence
[231] Computational Linguistics
[232] Computers and Artificial Intelligence
[233] Discrete Mathematics
[234] Fundamenta Informaticae
[235] Grammars. A Journal of Mathematical Research on Formal and
Natural Languages
[236] Information and Computation (before, Information and
Control)
[237] International Journal of Computer Mathematics
[238] International Journal of Foundations of Computer Science
[239] Journal of Automata, Languages and Combinatorics
[240] Journal of Combinatorial Theory
[241] Journal of Computer and System Sciences
[242] Journal of Language and Computation
[243] Journal of Logic, Language and Information
[244] Journal of the Association for Computing Machinery
[245] Journal of Universal Computer Science
[246] Kybernetika
[247] Linguistics and Philosophy
[248] Mathematical Systems Theory
[249] Michigan Mathematical Journal
16
[250] New Generation Computing
[251] Pacific Journal of Mathematics
[252] Prague Studies in Mathematical Linguistics
[253] Proceedings of the London Mathematical Society
[254] Revue Française d’Automatique, Informatique et Recherche
Opérationelle: Informatique Théorique
[255] Revue Roumaine de Linguistique: Cahiers de Linguistique
Théorique et Appliquée
[256] Revue Roumaine de Mathématiques Pures et Appliquées
[257] Studi si Cercetari Matematice
[258] Theoretical Computer Science
[259] Web Journal of Formal, Computational and Cognitive
Linguistics
FORTHCOMING REFERENCES
[260] Martín-Vide, C. & V. Mitrana, eds. (2000), Where
mathematics, computer science, linguistics and biology meet. Kluwer,
Dordrecht.
[261] Martín-Vide, C. & V. Mitrana, eds. (2000), Words, sequences,
grammars, languages, submitted to Gordon & Breach, London.
17