A Course in Formal Languages, Automata and Groups (Universitext)
Language: English
Published by Springer, 2009
Series: Book 52 of 261 - Universitext
- Softcover
- Used

Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.-OnTimeBooks-
AbeBooks seller since March 9, 2023
Condition: Used - Good
US$ 35.08
Quantity: 1 available
Add to basketItem description from seller
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.
Seller Inventory # OTV.1848009399.G
- Title
- A Course in Formal Languages, Automata and Groups (Universitext)
- Author
- Chiswell, Ian M.
- Publisher
- Springer
- Publication year
- 2009
- Condition
- good
- Binding
- Soft cover
- Language
- English
- ISBN 10
- 1848009399
- ISBN 13
- 9781848009394
- Series
- Book 52 of 261: Universitext
"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.
"About the title" may belong to another edition of this title.
-OnTimeBooks-
Phoenix, AZ, U.S.A.
AbeBooks seller since March 9, 2023
Shipping rates within U.S.A.
| Item | 3 to 8 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 3.99 |
Payment methods
Specialty
Used books of all typesSeller's business information
BookDrop LLC
601 S 54th Ave, STE 101
Phoenix, AZ U.S.A. 85043