{"product_id":"9781848009394","title":"A Course in Formal Languages, Automata and Groups (Universitext)","description":"\u003cp\u003eThis book is based on notes for a master's course given at Queen Mary, University of London, in the 1998\/9 session. 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.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Default Title","offer_id":49662516068600,"sku":"00000_00000_00000_00000","price":107.69,"currency_code":"AUD","in_stock":true}],"url":"https:\/\/kinokuniya.com.au\/products\/9781848009394","provider":"Books Kinokuniya Australia","version":"1.0","type":"link"}