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

Mostrar otras versiones (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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Davis, Martin, 1928-2023 (Autor), Sigal, Ron (Autor), Weyuker, Elaine J. (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Boston : Academic Press, Harcourt, Brace, 1994.
Edición:2nd ed.
Colección:Computer science and scientific computing.
Temas:
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.
Acceso en línea:Texto completo

Internet

Texto completo

Items no disponibles

Detalle de Existencias desde

Ejemplares similares