Cover Image

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
Main Authors: Davis, Martin, 1928-2023 (Author), Sigal, Ron (Author), Weyuker, Elaine J. (Author)
Corporate Author: ScienceDirect (Online service)
Format: eBook
Language:English
Published: Boston : Academic Press, Harcourt, Brace, 1994.
Edition:2nd ed.
Series:Computer science and scientific computing.
Subjects:
Machine theory.
Computational complexity.
Formal languages.
Théorie des automates.
Complexité 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é de calcul (informatique)
Automates mathématiques, Théorie des.
Fonctions calculables.
Electronic books.
Online Access:Connect to the full text of this electronic book

Internet

Connect to the full text of this electronic book

Available Online

Holdings details from Available Online
Call Number: QA267 .D38 1994eb
 
Call Number Status Get It
QA267 .D38 1994eb Available