Computability, complexity, and languages : fundamentals of theoretical computer science /

Show other versions (2)

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Authors: Davis, Martin, 1928-2023 (Author), Sigal, Ron (Author), Weyuker, Elaine J. (Author)
Format: Electronic eBook
Language:Inglés
Published: Boston : Academic Press, Harcourt, Brace, 1994.
Edition:2nd ed.
Series:Computer science and scientific computing.
Subjects:
Machine theory.
Computational complexity.
Formal languages.
Th�eorie des automates.
Complexit�e de calcul (Informatique)
Langages formels.
MATHEMATICS > Infinity.
MATHEMATICS > Logic.
Computational complexity
Formal languages
Machine theory
Informatica.
Fundamentele informatica.
Mathematics.
Physical Sciences & Mathematics.
Algebra.
Linguagens formais e automatos.
Computabilidade e modelos de computacao.
Complexit�e de calcul (informatique)
Automates math�ematiques, Th�eorie des.
Fonctions calculables.
Online Access:Texto completo

Internet

Texto completo

Items no disponibles

Holdings details from

Similar Items