Librería Bonilla. Desde 1950

	Título:
	Autor:	Precio: $717.00
	Editorial:	Año: 2009
	Tema:	Edición: 1ª
	Sinopsis	ISBN: 9781848009394
	Based on the author's lecture notes for an MSc course, this text combines formal language and automata theory and group theory, a thriving research area that has developed extensively over the last twenty-five years. The aim of the first three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Chapter One begins with languages defined by Chomsky grammars and the idea of machine recognition, contains a discussion of Turing Machines, and includes work on finite state automata and the languages they recognise. The following chapters then focus on topics such as recursive functions and predicates; recursively enumerable sets of natural numbers; and the group-theoretic connections of language theory, including a brief introduction to automatic groups.

Sucursal CDMX