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...
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 |
Ejemplares similares
-
Modern applications of automata theory /
Publicado: (2012) -
Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 /
Publicado: (2001) -
Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 /
Publicado: (2001) -
A computable universe : understanding and exploring nature as computation /
Publicado: (2013) -
Stochastic complexity in statistical inquiry /
por: Rissanen, Jorma
Publicado: (1989)