A Course in Formal Languages, Automata and...

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

46,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-4 Werktage

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

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.

Zusammenfassung

Most books on formal languages and automata are written for undergraduates in computer science; in contrast, this book provides a rigorous text aimed at the postgraduate-level mathematician with precise definitions and clear and succinct proofs.

The book examines the interplay between group theory and formal languages, and is the first to include an account of the significant Muller-Schupp theorem.

Includes a clear account of deterministic context-free languages and their connection with LR(k) grammars.

A complete solutions manual is available to lecturers via the web.

Includes supplementary material: [...]

Request lecturer material: [...]

Inhaltsverzeichnis

Preface.- Contents.- 1. Grammars and Machine Recognition.- 2. Recursive Functions.- 3. Recursively Enumerable Sets and Languages.- 4. Context-free language.- 5. Connections with Group Theory.- A. Results and Proofs Omitted in the Text.- B. The Halting Problem and Universal Turing Machines.- C. Cantor's Diagonal Argument.- D. Solutions to Selected Exercises.- References.- Index.

Details

Erscheinungsjahr:	2009
Fachbereich:	Arithmetik & Algebra
Genre:	Importe , Mathematik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Reihe:	Universitext
Inhalt:	ix 157 S. 30 s/w Illustr. 157 p. 30 illus.
ISBN-13:	9781848009394
ISBN-10:	1848009399
Sprache:	Englisch
Herstellernummer:	12258079
Ausstattung / Beilage:	Paperback
Einband:	Kartoniert / Broschiert
Autor:	Chiswell, Ian M.
Hersteller:	Springer London Springer-Verlag London Ltd. Universitext
Verantwortliche Person für die EU:	Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße:	235 x 155 x 10 mm
Von/Mit:	Ian M. Chiswell
Erscheinungsdatum:	06.02.2009
Gewicht:	0,265 kg

Artikel-ID: 101751254