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:
Computational complexity.
Machine theory.
Complexité de calcul (Informatique)
Théorie des automates.
MATHEMATICS > Infinity.
MATHEMATICS > Logic.
Computational complexity
Machine theory
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Cover; Preface; Notations; Contents; Chapter 0. Introduction; Chapter 1. DFA and NFA; Chapter 2. Context-Free Grammars; Chapter 3. Pushdown Automata; Chapter 4. Turing Machines; Chapter 5. Chomsky Hier archy; Chapter 6. Computability; Chapter 7. Complexity Theory; Chapter 8. Propositions and Predicates; Answers to Exercises; University Question Papers; Bibliography; index

Ejemplares similares