Intended for graduate students and advanced undergraduates in computer science a second course in formal languages and automata theory treats topics in the theory of computation not usually covered in a first course after a review of basic concepts the book covers combinatorics on words regular languages context free languages parsing and recognition turing machines and other language classes many topics often absent from other textbooks such as repetitions in words state . Written for graduate students and advanced undergraduates in computer science a second course in formal languages and automata theory treats topics in the theory of computation not usually covered in a first course after a review of basic concepts the book covers combinatorics on words regular languages context free languages parsing and recognition turing machines and other language classes many topics often absent from other textbooks such as repetitions in words state . A second course in formal languages and automata theory intended for graduate students and advanced undergraduates in computer science a second course in formal languages and automata theory treats topics in the theory of computation not usually covered in a first course after a review of basic concepts the book covers combinatorics on words regular. Intended for graduate students and advanced undergraduates in computer science a second course in formal languages and automata theory treats topics in the theory of computation not usually covered in a first course after a review of basic concepts the book covers combinatorics on words regular languages context free languages parsing and recognition turing machines and other language classes many topics often absent from other textbooks such as repetitions in words