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)