A Course in Formal Languages, Automata and Groups by Ian M. Chiswell.

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 notion...

Full description

Saved in:
Bibliographic Details
Main Author: Chiswell, Ian M. (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: London : Springer London : Imprint: Springer, 2009.
Edition:1st ed. 2009.
Series:Universitext,
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3324327
003 MWH
005 20191025201820.0
007 cr nn 008mamaa
008 110406s2009 xxk| s |||| 0|eng d
020 |a 9781848009400 
024 7 |a 10.1007/978-1-84800-940-0  |2 doi 
035 |a (DE-He213)978-1-84800-940-0 
050 4 |a E-Book 
072 7 |a PBG  |2 bicssc 
072 7 |a MAT002010  |2 bisacsh 
072 7 |a PBG  |2 thema 
100 1 |a Chiswell, Ian M.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 2 |a A Course in Formal Languages, Automata and Groups  |h [electronic resource] /  |c by Ian M. Chiswell. 
250 |a 1st ed. 2009. 
264 1 |a London :  |b Springer London :  |b Imprint: Springer,  |c 2009. 
300 |a IX, 157 p. 30 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Universitext,  |x 0172-5939 
490 1 |a Springer eBook Collection 
505 0 |a 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. 
520 |a 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: A comprehensive study of context-free languages and pushdown automata in Chapter Four, in particular a clear and complete account of the connection between LR(k) languages and deterministic context-free languages. A self-contained discussion of the significant Muller-Schupp result on context-free groups. 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. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Group theory. 
650 0 |a Mathematical logic. 
650 0 |a Algebraic topology. 
650 0 |a Manifolds (Mathematics). 
650 0 |a Complex manifolds. 
650 0 |a Category theory (Mathematics). 
650 0 |a Homological algebra. 
690 |a Electronic resources (E-books) 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Universitext,  |x 0172-5939 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-1-84800-940-0  |3 Click to view e-book  |t 0 
907 |a .b3324327x  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g xxk  |h 2  |i 1 
912 |a ZDB-2-SMA 
950 |a Mathematics and Statistics (Springer-11649) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i22374899  |z 02-26-20 
999 f f |i 36a34e29-fe2c-5f14-9e3e-1dabb19b4d56  |s b1315e05-84b8-54a7-9cb6-67432b3d35e8  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File