Cover Image

Automata and computability /

Show other versions (1)

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well...

Full description

Bibliographic Details
Main Author: Kozen, Dexter, 1951-
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: New York : Springer, [1997]
Series:Undergraduate texts in computer science.
Subjects:
Machine theory.
Computable functions.
machine Turing.
langage algébrique.
automate.
calculabilité.
fonction calculable.
théorie machine.
Fundamentele informatica.
Abstracte automaten.
Berekenbaarheid.
Automatentheorie.
Automates mathématiques, théorie des.
Machines séquentielles, Théorie des.
Complexité de calcul (informatique)
Turing, Machines de.
Kellerautomat.
Kontextfreie Grammatik.
Turing-Maschine.
Berechenbarkeit.
Endlicher Automat.
Reguläre Menge.
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 .K69 1997eb
 
Call Number Status Get It
QA267 .K69 1997eb Available