This book is based on notes for a master’s course given at Queen Mary, University of London, in the 1998/9 session. Such courses in London are quite short, and the course consisted essentially of the material in the ?rst three chapters, together with a two-hour lecture on connections with group theory. Chapter 5 is a considerably expanded version of this. For the course, the main sources were the books by Hopcroft and Ullman ([20]), by Cohen ([4]), and by Epstein et al. ([7]). Some use was also made of a later book by Hopcroft and Ullman ([21]). The ulterior motive in the ?rst three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Three such notions are considered. These are: generated by a type 0 grammar, recognised by a Turing machine (deterministic or not) and de?ned by means of a Godel ¨ numbering, having de?ned “recursively enumerable” for sets of natural numbers. It is hoped that this has been achieved without too many ar- ments using complicated notation. This is a problem with the entire subject, and it is important to understand the idea of the proof, which is often quite simple. Two particular places that are heavy going are the proof at the end of Chapter 1 that a language recognised by a Turing machine is type 0, and the proof in Chapter 2 that a Turing machine computable function is partial recursive.
"Sinopsis" puede pertenecer a otra edición de este libro.
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. Highlights include:
Enriched with precise definitions, clear and succinct proofs and worked examples, the book is aimed primarily at postgraduate students in mathematics but will also be of great interest to researchers in mathematics and computer science who want to learn more about the interplay between group theory and formal languages.
A solutions manual is available to instructors via www.springer.com.
"Sobre este título" puede pertenecer a otra edición de este libro.
Sus derechos de garantía legal: Todos los consumidores de la UE se benefician de al menos dos años de protección de garantía legal para cualquier bien de consumo que se venda en la UE. Ver más
Librería: -OnTimeBooks-, Phoenix, AZ, Estados Unidos de America
Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Nº de ref. del artículo: OTV.1848009399.G
Cantidad disponible: 1 disponibles
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABBB-152583
Cantidad disponible: 1 disponibles
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJAN27-203758
Cantidad disponible: 1 disponibles
Librería: Books Puddle, Woodside, NY, Estados Unidos de America
Condición: Used. pp. 168. Nº de ref. del artículo: 26444423
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: Used. pp. 168 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 7436248
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 5839240-n
Cantidad disponible: Más de 20 disponibles
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
Paperback or Softback. Condición: New. A Course in Formal Languages, Automata and Groups. Book. Nº de ref. del artículo: BBS-9781848009394
Cantidad disponible: 5 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: Used. pp. 168. Nº de ref. del artículo: 18444429
Cantidad disponible: 1 disponibles
Librería: Chiron Media, Wallingford, Reino Unido
PF. Condición: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Nº de ref. del artículo: 6666-IUK-9781848009394
Cantidad disponible: 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 5839240
Cantidad disponible: Más de 20 disponibles