Cargando…

Theory of automata, formal languages and computation /

This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Xavier, Eugene, S. P.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New Delhi : New Age International Ltd., Publishers, 2005.
Temas:
Acceso en línea:Texto completo
Descripción
Sumario:This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.
Notas:Title from e-book title screen (viewed May 21, 2008).
Descripción Física:1 online resource (1 volume)
Bibliografía:Includes bibliographical references and index.
ISBN:8122423345
9788122423341
1281224480
9781281224484
9786611224486
6611224483