Track My Order
Help Centre
1300 187 187
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
A Course in Formal Languages, Automata and Groups - Ian M. Chiswell

A Course in Formal Languages, Automata and Groups

By: Ian M. Chiswell

eText | 14 November 2008

At a Glance

eText

$84.99

or 4 interest-free payments of $21.25 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.
on
Desktop
Tablet
Mobile

You Can Find This eBook In

Non-FictionComputing & I.T.Computer ScienceLanguage & LinguisticsLinguisticsMathematicsAlgebraGroups & Group TheoryMathematical FoundationMathematical LogicTopology

More in Algebra

Calculus for the Curious - Nick McIntyre

eBOOK

Calculus for the Curious

eBook

RRP $69.92

$55.99

20%
OFF

This product is categorised by