Items related to A Course in Formal Languages, Automata and Groups (Universit...
Synopsis
This comprehensive text uniquely presents a thorough introduction into the connections between group theory and formal languages. It also offers precise definitions, clear and succinct proofs, and an account of the Muller-Schupp theorem.
"synopsis" may belong to another edition of this title.
From the Back Cover
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.
Review
From the reviews:
"This short work by Chiswell ... covers formal languages, automata theory, and the word problem in group theory. This content is bound together by the unifying theme of what is known as Church’s thesis, which states that any desirable definition of computability should coincide with recursiveness. ... Several appendixes serve as homes for ... distracting proofs of results needed in the main body of the text, or for solutions to selected instances of the abundant exercises. Summing Up: Recommended. Academic readers, upper-division undergraduates through researchers/faculty." (F. E. J. Linton, Choice, Vol. 46 (11), 2009)
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2009
- ISBN 10 1848009399
- ISBN 13 9781848009394
- BindingPaperback
- LanguageEnglish
- Number of pages166
Search results for A Course in Formal Languages, Automata and Groups (Universit...
Stock Image
A Course in Formal Languages, Automata and Groups
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 168. Seller Inventory # 26444423
Quantity: 1 available
Stock Image
A Course In Formal Languages, Automata And Groups
Seller: Basi6 International, Irving, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-244658
Quantity: 1 available
Stock Image
A Course In Formal Languages, Automata And Groups
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # ABTA-215743
Quantity: 1 available
Stock Image
A Course in Formal Languages, Automata and Groups
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. 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. Seller Inventory # 7436248
Quantity: 1 available
Stock Image
A Course in Formal Languages, Automata and Groups
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. pp. 168. Seller Inventory # 18444429
Quantity: 1 available
Stock Image
A Course in Formal Languages, Automata and Groups (Universitext)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar2912160247948
Quantity: Over 20 available
Stock Image
A Course in Formal Languages, Automata and Groups (Universitext)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9781848009394
Quantity: Over 20 available
Stock Image
A Course in Formal Languages, Automata and Groups (Universitext)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781848009394_new
Quantity: Over 20 available
Seller Image
A Course in Formal Languages, Automata and Groups
Published by
Springer London Feb 2009, 2009
ISBN 10: 1848009399
ISBN 13: 9781848009394
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 168 pp. Englisch. Seller Inventory # 9781848009394
Quantity: 2 available
Stock Image
A Course in Formal Languages, Automata and Groups
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9781848009394
Quantity: 10 available