Aarts, E., & Korst, J. (1990). Simulated annealing and Boltzmann machines:
a stochastic approach to combinatorial optimization and neural computing.
Adam, A. (1996). The behaviour and simplicity of finite
Adleman, L. M. (1994). Molecular computation of
solutions to combinatorial problems. Science,
266, 1021-1024
Adriaans, P. (2002). Grammatical inference: algorithms and applications. Springer
Verlag. Catálogo
Jábega
Agar, Jon. (2001). Turing and the Universal Machine : The Making of the Modern Computer
Agre, P. E. (1997). Computation and human experience.
Akama, S. (1997). Logic, language and computation. Kluwer Academic Publishers. EI
MA/753
Alfonseca,
M., Sancho, J., & Artínez, M. (1987). Teoría
de lenguajes, gramáticas y autómatas. Madrid: Universidad y Cultura.
[Dpto.Leng.CC:EI
LC/2312]
Amos,
M. (2003). Theoretical
and experimental DNA computation. Springer Verlag.
Arbib, M. A. (1969). Theories of abstract automata.
Arbib, M., Kfoury, A., & Moll, R. (1981). A basis for theoretical computer science.
Atallah, M. (1998). Algorithms and theory of computation handbook. CRC Press.
Baldi, P., & Brunak, S. (2001). Bioinformatics: the machine learning approach.
MIT Press. EI
LC/4461
Ballard, D. H. (1997). An introduction to natural computation. MIT Press.
Barbosa, V. C. (1993). Massively parallel models of computation: distributed parallel
processing in artificial intelligence and optimization. Prentice
Hall. EI LC/1480
Beckman, F. (1980). Mathematical foundations of programming. Addison-Wesley.
[Dpto.Leng.CC:EI
LC/2509]
Blum, L., Cucker, F., Shub, M., & Smale, S.
(1998). Complexity and real computation.
Springer Verlag. EI
LC/3216
Bonzini, C. (1994). Semigroups : algebraic theory and applications to formal languages and
codes. World Scientific Pub Co.
Bose, P., & Morin, P. (2002). Algorithms and computation.
Springer Verlag. [Catálogo
Jábega]
Brainerd, W. S., & Landweber, L. H. (1974).
Theory of computation. Wiley.
Brauer, W., & Rozemberg, G. (2002). Formal and natural computing: essays
dedicated to Grzegorz Rozenberg. Springer Verlag.
Brookshear, J. G. (1989). Theory of computation: formal languages, automata, and complexity.
Pearson
Education POD. FL
L-15/2/8 (Humanidades)
Brookshear,
J. G. (1995). Introducción a las Ciencias
de la Computación. Addison-wesley. [Biblioteca F-0/BRO/int]
Brylinski, R. K., & Chen, G. (2002). Mathematics of quantum computation.
CRC Press.
Börger, E., & Stärk, R. (2003). Abstract state machines: a method for
high-level system design and analysis. Springer Verlag.
Calude, C., Casti, J. L., & Dineen, M. J.
(2002). Unconventional models of
computation. Springer Verlag. [Catálogo
Jábega]
Calude, C., & Paun, G. (2001). Computing with cells and atoms : an
introduction to quantum, DNA and membrane computing. Taylor &
Francis
Cann, R. (1993). Formal semantics. Cambridge University Press.
Carroll, J., & Long, D. (1989). Theory of finite automata. Prentice
Hall.
Cases
Muñoz, Rafel y Màrquez Villodre, Lluís Lenguajes,
gramáticas y autómatas. Curso básico Edicions UPC, 2000.
Chaitin, G. (1999). The unknowable. Springer-Verlag. [Dpto.Leng.CC:EI
LC/3468]
Chomsky, N. (2002). On nature and language. Cambridge University Press.
Clark, K. L., & Cowell, D. (1976). Programs, machines, and computation: an
introduction to the theory of computing. McGraw Hill.
Clote, P., & Kranakis, E. (2002). Boolean functions and computation models.
Springer Verlag.
Cole, J. (1995). Linguistics and computation. Cambridge University Press.
Crutchfield, J. P., & Schuster, P. (2003). Evolutionary dynamics: Exploring the
interplay of selection, accident, neutrality, and function. Oxford Press.
Cueva
Lovelle, J. M. Lenguajes, gramáticas y
autómatas. Universidad de Oviedo.
Cutland, N.J. Computability : An Introduction to Recursive Function Theory. EI LC/258 Indice
Dassow, J., & Paun, G. (1990). Regulated rewriting in formal language
theory. Springer Verlag.
Davis, M. (1983). Computability and unsolvability. Dover Pubns. EI LC/338 Indice
Davis, M. D., Sigal, R.,
& Weyuker, E. J. (1994). Computability,
complexity and languages: fundamentals of theoretical computer science.
Academic Press. EI LC/1466 [Dpto. Leng. CC: EI LC/2383] Indice
Davis, Martin. The Undecidable : Basic Papers on Undecidable Propositions, Unsolvable
Problems and Computable Functions.
de
Jong, K. A. (2002). Evolutionary computation. MIT Press. [Catálogo Jábega]
de
Luca, A., & Varricchio, S. (1999). Finiteness and regularity in semigroups and formal
languages. Springer Verlag.
de
Sande, F. Prácticas de Teoría de
Autómatas y Lenguajes Formales Consejería de Educación, Cultura y Deportes
del Gobierno de Canarias, 2001. ISBN: 84-699-4090-2.
Dijkstra,
E. (1990). Formal
development of programs and proofs. Addison
Wesley Professional.
Dogaru, R. (2003). Universality and emergent computation in cellular neural networks.
Imperial College Press.
Dowty, D., Wall, R., & Peters, S. (1981).
Introduction to Montague semantics. Reidel. [Depósito: FL
C-3/5/4]
Drobot, V. (1989). Formal languages and automata theory. Computer Science Pr. EI LC/2289
Eck, D. J. (2000). The most complex machine: a survey of computers and computing.
A.K. Peters.
Ehrig, H., Kreowski, H. J., Montanari, U.,
& Rozemberg, G. (1999). Handbook of
graph grammars and computing by graph transformations. World
Scientific Pub Co.
Eilenberg, S. (1976). Automata, languages and machines. Academic Press. EI LC/2281,I-II
Engeler, E. (1973). Introduction to the theory of computation. Academic Press. EI LC/3223
Feferman, S. (1998). In the light of logic. Oxford University Press. FL H-30/4/13
Feynman, R., Allen, R. W., & Hey, A.
(2000). Feynman lectures on computation.
Perseus Publishing. Indice
Flake, G. W. (1998). The computational beauty of nature. MIT Press. FCF519.85/FLA/com
Fleck, Arthur (2001). Formal models of computation: the ultimate
limits of computing. World Scientific Pub Co. EI LC/5065
Floyd, R. W., & Beigel, R. (1994). The language of machines: an introduction to
computability and formal languages. W.H. Freeman & Co. EIF-4/FLO/lan
[Dpto. Leng. CC:EI LC/1260;
Dpto. Leng. CC:EI LC/2630]
Fogel, D. B. (1999). Evolutionary computation: toward a new philosophy of machine
intelligence. Wiley-IEEE Press. EI
LC/3591
Forcada,
M. L. (2002). Neural
networks: automata and formal models of computation.
Forrest, S. (1991). Emergent computation. MIT Press. EP 1/3848
Gabbay, D. M. (1995). What is a logical system? Oxford University Press. EI
MA/848
Galán
Pascual C., Sanchís Llorca F. J. Compiladores. Paraninfo (1986)
García,
M. (1997). Teoría de autómatas y lenguajes
formales. Jaén: Universidad de Jaén, Departamento de Informática, D.L.
[Biblioteca:FT
A/111 (Politécnica) ]
Gardner, M. (1971). On cellular automata, self-reproduction, the garden of Eden and the
game of 'life'. Scientific American, 224(2):112-117
Gardner, M. (1983). Wheels, life, and other mathematical amusements. New York: W H Freeman &
Co.[Psicología y Ciencias de la Educación: EP X/119]
Garzon, M. (1995). Models of massive parallelism : analysis of cellular automata and
neural networks. Berlin: Springer-Verlag. [Dpto. Tecn. El.:EI
LC/2044]
Gécsec, F., & Peák., I. (1972). Algebraic theory of automata. Budapest:
Akadémiai Kiadó. [Dpto.Fis.Aplic.:FCF519.71/GEC
-/alg]
Ginsburg, S. (1975). Algebraic and automata-theoretic properties of formal languages.
North-Holland. [Dpto.Alg.Geom.T:FCA519.76/GIN - /alg (Ciencias)]
Giunti, M. (1901). Computation, dynamics, and cognition. Oxford University
Press.
Goldblatt, R. (1992). Logics of time and computation. CSLI Publications.
Goldstein, Rebecca. Incompleteness: The Proof and Paradox of Kurt Godel (Great Discoveries).
Gramb, T., Bornholdt, S., Grob, M.,
Mitchell, M., & Pellizzari, T. (1999). Non-standard
computation: molecular computation - cellular automata - evolutionary
algorithms - quantum computers. John Wiley & Sons .
Grau,
Antoni. Introducción a Los Autómatas
Programables (cdrom + Libro).
Grau
Saldes, Antoni. Diseño Y Aplicaciones Con
Autómatas Programables (cdrom + Libro).
Greenlaw, R., & Hoover, H. J. (1998). Fundamentals of the theory of computation:
principles and practice. Morgan Kaufmann. Indice
Greenlaw, R., Hoover, H. J., & Ruzzo, W. L.
(1995). Limits to parallel computation:
P-completeness theory. Oxford University Press.
Grossman, P. (1995). Discrete mathematics for computing. Palgrave Macmillan.
Gupta, M., Saridis, G., & Gaines, B. (1977). Fuzzy automata and decision processes. New York: North-Holland. [Dpto.Leng.CC:EI
LC/2330; Dpto.Leng.CC:EI
LC/2328]
Gutfreund, H. (1994). Biology and computation: a physicist's choice. World
Scientific Pub Co.
Guttenplan, S. (1997). The languages of logic: an introduction to formal logic.
Blackwell Publishers. FL E-1/4/16 Indice
Gödel, K. (1992). On formally undecidable propositions of Principia Mathematica and
related systems. Dover Pubns.
Hamburger, H., & Richards, D. (2002). Logic and language models for computer
science. Prentice Hall.
Hand, D. J., Mannila, J., & Smyth, P.
(2001). Principles of data mining.
MIT Press. EI LC/4426
Hartmanis, J. (1978). Feasible computations and provable complexity properties.
Philadelphia: Society for Industrial and Applied Mathematics. [Dpto.Leng.CC:EI
LC/1395]
Hawkins, H. L., McMullen, T. A., Popper, A. N.,
& Fay, R. R. (1996). Auditory
computation. Springer Verlag.
Heiko, D. (1995). Efficient graph rewriting and its implementation. Springer
Verlag.
Hein, J. L. (1996). Theory of computation: an introduction. Jones & Bartlett
Pub.
Hennie, Fred. Introduction to Computability Addison-Wesley, 1977. ISBN: 0-201-02848-4
Herman, G. T., Rozemberg, G., &
Lindenmayer, A. (1975). Developmental
systems and languages. Elsevier Science Ltd.
Hermes, H. (1969). Enumerability, decidability, computability: an introduction to the
theory of recursive functions. Springer Verlag. EIF-4/HER/enu [Biblioteca:FTF-4/HER/enu; Dpto.
Mat. Apl.:FT 51/1319]
Hermes, H. (1984). Introducción a
la teoría de la computabilidad: algoritmos y maquinas. Ed. Tecnos. [Biblioteca:EIF-2/HER/int;
Dpto.Mat. Apli:EI MA/29, 30 y 76]
Herken, R. (1988). The Universal Turing machine: a half-century survey. Oxford
University Press. [Dpto.Leng.CC:EI
LC/2327]
Hey, A. (1998). Feynman and computation: exploring the limits of computers.
Perseus Books Group.
Hirvensalo,
M. (2001). Quantum computing. Springer Verlag.
Hoare, C. A. R. (1985). The mathematics
of programming. In C.A.R. Hoare, & C. B. Jones (Eds.), Essays in computing science (pp. 351-370). EI LC/2448
Hoare, C. A. R. (1986). The mathematics of programming: an inaugural lecture delivered before
the Univ. of Oxford on 17 Oct 1985. Clarendon Pr.
Hofstadter, D. R. (1999). Gödel, Escher, Bach: an eternal golden braid. Basic Books.
Hofstadter, D. (1992). Gödel, Escher, Bach: un eterno y grácil bucle. TusQuets
Editores, 4ª ed. [Depósito:FL
N-13/5/19 (Humanidades); Sala Investig.:FD 340.12 2492 (Derecho)]
Hofstadter, D. R. (1999). Gödel, Escher, Bach: un eterno y grácil bucle. Tusquets,
1987. EP 1/2522
Holcombe, M., Cuthbertson, R., & Pato, R.
(1997). Computation in cellular and
molecular biological systems. World Scientific Pub Co.
Homer, S., Selman, A.L.
(2001). Computability and Complexity
Theory. Springer. [Biblioteca: EIF-2/HOM/com]
Hopcropft, J. E.,
Motwani, R., & Ullman, J. D. (2000). Introduction
to automata theory, languages, and computation. Pearson Addison
Wesley. EI
LC/4978 Edición 1979: [Biblioteca:FT T/402-3-4-5-6
(Politécnica); Dpto.Leng.CC:EI LC/1285;
Biblioteca:EIF-4/HOP/int]
Horst, S. W. (1996). Symbols, computation, and intentionality: a critique of the
computational theory of mind. University of California Press.
Howie, J. M. (1996). Automata and languages. Clarendon Pr. EIF-4/HOW/aut [Dpto.Leng.CC:EI LC/1250]
Hoyle, M. A. (1994) The history of computer science. URL http://www.eingang.org/Lecture/toc.html
Huberman, B. A. (1988). The ecology of computation. North-Holland. EII-2/ECO
Ilachinski, A. (2001). Cellular automata: a discrete universe. World Scientific Pub
Co. EI
LC/5187
Isasi, P., Martínez, P., & Borrajo, D. (1997). Lenguajes, gramáticas y autómatas: un enfoque práctico. Madrid:
Addison-Wesley, D.L. [Dpto.Leng.CC: EI
LC/3358; Biblioteca:EII-0/ISA/len]
Jackendoff, R. (2002). Foundations of language: brain, meaning, grammar, evolution .
Oxford University Press.
Johnson, S. (2002). Emergence: the connected live of ants, brains, cities, and software.
Scribner.
Kari, J., Kari, L., & Landweber, L. F.
(1999). Reversible molecular computation in ciliates. In Jewels are forever (pp. 353-363). Springer-Verlag.
Kari, L. (2001). DNA computing in vitro and in
vivo. Theoretical Computer Science, 17(7),
823-834. [Catálogo Jábega]
Kelley, D. (1998). Automata and formal languages: an introduction. Pearson Education POD. [Biblioteca: EIF-2/KEL/teo]
Kelley,
D. (1995). Teoría de Autómatas y
Lenguajes Formales. Prentice Hall International
(UK) Ltd. [Biblioteca:
EIF-2/KEL/teo
]
Kennedy, J., Eberhart, R., & Shi, Y.
(2001). Swarm intelligence.
Morgan Kaufmann Pub.
Kfoury, A., Moll, R., &
Arbib, M. (1986). A programming approach
to computability. New York: Springer-Verlag. [Dpto.Leng.CC:EI
LC/2323]
Kitaev, A. Y., Shen, A. H., & Vyalyi, M. N.
(2002). Classical and quantum computation.
American Mathematical Society
Kleene, S. C. (1956). Representation of events
in nerve nets and finite automata. In C. Shannon, & J. McCarthy (Eds.), Automata studies (pp. 3-42). Princeton,
NJ: Princeton University Press.
Kohanski, D. (1998). The philosophical programmer: reflections on the moth in the machine.
St. Martin's Press
Kozen, D. (1997). Automata and computability. New York: Springer. [Dpto.Leng.CC: EI
LC/2697] Indice
Lalement, R. (1990). Computation as logic. Prentice Hall.
Landweber, L. H., & Winfree, E. (2001). Evolution as computation. Springer
Verlag
Langton, C. G. (1995). Artificial life: an overview. Reading, MA: Addison-Wesley. [Dep.
LCC: EI LC/5045 ]
Levy, S. (1993). Artificial life: the quest for a new creation. London: Penguin. [Sala Consulta:CI 001/LEV/art]
Leeuwen
van, J. (1990). Handbook
of theoretical computer science. Elsevier /
MIT Press. Catálogo Jábega
Lewis,
H. R., & Papadimitriou, C. (1997). Elements of the theory of computation. Prentice
Hall. EIF-2/LEW/ele [Dpto.Leng.CC:EI LC/17; Biblioteca:EIF-0/LEW/ele;
Depósito:FL L-15/2/11 (Humanidades);
Biblioteca:FT V/82 (Politécnica)] Indice
Lindenmayer, A. (1968). Mathematical models for cellular interaction in development I.
Filaments with one-sided inputs. Journal of Theoretical Biology,
18:280-289
Lingas, A., & Nilsson, B. J. (2003). Fundamentals of computation theory.
Springer Verlag
Telos. Catálogo Jábega
Linz, P. (2000). An introduction to formal languages and automata. Jones &
Bartlett Pub. [Dpto.Leng.CC:EI
LC/2646] Indice
Liu, J. (2001). Autonomous agents and multi-agent systems: explorations in learning,
self-organization and adaptive computation. World Scientific Pub Co. EI LC/4955
Lucas, M., Peyrin, J., & Scholl, P. (1985).
Algorítmica y representación de datos. Barcelona: Masson. [Biblioteca:EIF-2/LUC/alg,I]
Luger,
G. F. (1995). Computation
and intelligence: collected readings.
AAAI Press.
Lundh, D., Olsson, B., & Narayanan, A.
(1997). Biocomputing and emergent
computation. World Scientific Pub Co.
Luo, Z. (1994). Computation and reasoning: a type theory for computer science.
Oxford University Press.
MacNaughton, R. (1993). Elementary computability, formal languages, and automata. Z B
Publishing Industries. [Dpto.Leng.CC:EI
LC/2648]
Mahoney, M. S. (2000). Software as science. In Mapping the history of computing: software
issues. Proceedings of the International conference on history of Computing.
Malpica,
J. (1998). Introducción a la teoría de
autómatas. Alcalá de Henares: Servicio de Publicaciones de la Universidad
de Alcalá de Henares, D.L. [Biblioteca:EIG-0/MAL/int]
Mandelbrot, B. (1983). The fractal geometry of nature. New York: W.H. Freeman and Company.
[Dpto. Tecn.
El.:EI TE/398]
Manis, V. S., & Little, J. (1995). The schematics of computation.
Prentice Hall. EI LC/3188
Margenstern, M. (2001). Machines, computations and universality. Springer Verlag
Martin, J. C. (2002). Introduction to languages and the theory of computation.
McGraw-Hill. EIF-0/MAR/int Indice
Meduna, A. (2000). Automata and languages: theory and
applications. Springer Verlag. EI LC/5216 Indice
Minsky, M. L. (1967). Computation: finite and infinite machines. Prentice Hall. FC510.57/MIN/com
Mitchell, M., Hraber, P. T., & Crutcheld,
J. P. (1993). Revisiting the edge of chaos: Evolving cellular automata to
perform computations. Complex Systems, 7,
89-130.
Mogensen, T., & Jones, N. D. (2003). The Essence of Computation: Complexity,
Analysis, Transformation. Springer Verlag. EI LC/4238
Moll, R., Arbib, A., & Kfoury, A. (1988). An introduction to formal language theory.
Springer-Verlag. [Dpto.Leng.CC:EI
LC/2332]
Montague, R., & Thomason, R. H. (1979). Formal philosophy. Yale University
Press.
Moret, B. M. (1998). The theory of computation. Pearson Education POD.
Nagel, E., & Newman, J. R. (2002). Godel's proof. New York University
Press. EI LC/5047 Indice
Narendra, K., & Thathachar, M. (1989). Learning automata: an introduction.
Englewood Cliffs New Jersey: Prentice-Hall. [Biblioteca:EIU-3/NAR/lea]
Nielsen, M. A. C. I. L. (2000). Quantum computation and quantum information.
Cambridge University Press. EI LC/3895
Papadimitriou, C. (1994). Computational complexity. Addison-Wesley Pub Co. EIF-2/PAP/com
Papadimitriou, C. (2003). Turing. MIT Press.
Parkes, A. P. (2002). Introduction to languages, machines and logic. Springer
Verlag. Indice
Paton, R., Bolouri, H., Holcombe, M., Parish,
H., & Tateson, R. (2003). Computation
in cells and tissues: perspectives and tools of thought. Springer Verlag.
EI LC/5218
Paun, G. (2000). Computing with membranes. Journal of Computer and System Sciences, 61(1),
108-143. [Catálogo Jábega]
Paun,
G., Rozemberg, G., Salomaa, A., & Brauer, W. (1998). DNA computing: new computing
paradigms. Springer Verlag. EI LC/3473
Poundstone, W. (1985). The Recursive Universe: Cosmic Complexity and the Limits of Scientific
Knowledge. William Morrow and Company Inc.
Pylyshyn, Z. W. (1996). Computation and cognition: toward a foundation for cognitive science.
MIT Press. EP 1/1070
Rafael
C. Carrasco, Jorge Calera y Mikel L. Forcada. Teoría de lenguajes, gramáticas y autómatas para informáticos. Servicio de Publicaciones Universidad de
Alicante, 2000. ISBN: 84-7908-574-6.
Ramos,
I., & Fernández, M. (1995). Vida
artificial. Cuenca: Universidad de Castilla-La Mancha, Servicio de
Publicaciones. [Dpto.Leng.CC:EI
LC/3284; Biblioteca:EI I-2/VID]
Ramos
Jiménez, Gonzalo. Apuntes de Teoría de Autómatas y Lenguajes Formales I.
Editado por el autor (2003).
Rayward-Smith, V. J. A First Course in Computability. Blackwell Scientific Publications,
1986. ISBN: 0-632-01307.
Reade, C. (1989). Elements of functional programming . Addison-Wesley Pub
Co.
Revesz,
G.E. (1991). Introduction
to formal languages. Dover Pubs. EI LC/3705 Indice
Richards, W. (1989). Natural computation. MIT Press. FT IS/1183
Rocha, L. (Evolutionary systems and artificial
life. URL
Rodriguez,
C. (1991). Optimización de autómatas
finitos. Oviedo: Sección de Publicaciones de la Universidad de Oviedo. [Biblioteca:EI
043/36]
Rogers, Hartley. Theory of Recursive Functions and Effective Computability. EI LC/2533 Indice
Rohrer, C., Rossdeutscher, A., & Kamp, H.
(2001). Linguistic form and its
computation. University of Chicago Press.
Rosner, M., & Johnson, R. (1992). Computational linguistics and formal
semantics. Cambridge University Press.
Rozenberg, G., & Salomaa, A. (1997). Handbook of formal languages I.
Springer-Verlag. [Dpto.Leng.CC:EI
LC/2119,I]
Rozenberg, G., & Salomaa, A. (1997). Handbook of formal languages II.
Springer-Verlag. [Dpto.Leng.CC:EI
LC/2119,II]
Rozenberg, G., & Salomaa, A. (1997). Handbook of formal languages III.
Springer-Verlag. [Dpto.Leng.CC:EI
LC/2119,III]
Sag, I. A., & Wasow, T. (1999). Syntactic theory: a formal introduction.
CSLI Publications.
Salomaa, A. (1973). Formal languages. Academic Press. [Dpto.Leng.CC:EI
LC/2345]
Salomaa, A. (1985). Computation and automata. Cambridge University Press. Indice
Savage, J. E. (1998). Models of computation. Pearson Education POD. Indice
Siegelmann, H. T. (1999). Neural networks and analog computation: beyond the Turing limit.
Springer Verlag.
Siegelmann, H. T., & Sontag, E. D. (1991).
Turing computability with neural nets. Applied
Mathematics Letters, 4(6), 77-80. [1]
Sipper, M. (1997). Evolution of parallel cellular machines: the cellular programming
approach. Berlin: Springer-Verlag. [Dpto.Leng.CC:EI
LC/3580; Dpto. Tecn. El.:EI TE/866]
Sipper, M. (2002). Machine nature: the coming age of bio-inspired computing.
McGraw-Hill/Contemporary Books. EI LC/5203
Sipser, M. (1996). Introduction to the theory of computation. Brooks Cole.
EI LC/3223 Indice
Smith, C. (1994). A recursive introduction to the theory of computation.
Springer Verlag. Indice
Sommerhalder, R. and Van Westrhenen, S. (1988).
The theory of computability: programs,
machines, effectiveness and feasibility. Wokingham: Addison-Wesley.
[Dpto.Leng.CC:EI
LC/2324 y 1066; Biblioteca:EIF-2/SOM/the]
Sterling, T., Messina, P., & Smith, P.
(1995). Enabling technologies for
petaflops computing. MIT Press.
Strathern, Paul. Turing y el
ordenador.
Siglo XXI de España Editores, S.A.
Sudkamp, T. A. (1996). Languages and machines: an introduction to the theory of computer
science. Addison-Wesley Pub Co. EI LC/2326
Taylor, R. G. (1997). Models of computation and formal languages. Oxford University
Press. Indice
Toffoli, T., & Margolus, N. (1987). Cellular automata machines: a new
environment for modeling. MIT Press.
Turing, A. (On
computable numbers, with an application to the entscheidungsproblem http://www.abelard.org/turpap2/tp2-ie.asp
van
Leeuwen, J. (1990). Handbook of theoretical computer science.
MIT Press. Catálogo
Jábega
van
Lindonk, U. (1968). Mens & Machine - Teksten en documenten over Automaten, Andro den en
Robots verzameld door René Simmen. Amsterdam: IBM
Nederland NV
von Neumann, J. (1951). The general and
logical theory of automata. In L. A. Jeffers (Ed.), Cerebral mechanisms in behaviour: the Hixon symposium (pp. 1-31).
John Wiley & Sons.
Weisbuch, G. (1991). Complex systems dynamics: an introduction to automata networks.
Redwood City, California: Addison-Weley. [Dpto. Ing.Sis.A:EI
IS/440]
Wilf, H. S. (2002). Algorithms and complexity. A.K. Peters. EI LC/4304
Winskel, G. (1996). The formal semantics of programming languages: an introduction.
MIT Press. EI LC/1500
Wolfram, S. (2002). Cellular automata and complexity. Perseus Publishing.
Wolfram, S. (2002). A new kind of science. Wolfram Media, Inc.
Wood, D. (1980). Grammar and L forms: an introduction. Springer Verlag.
Wood, D. (1986). Theory of computation. John Wiley & Sons. EIF-2/WOO/the
Yan, S. Y. (1996). An introduction to formal languages and machine computation.
World Scientific Pub Co.