2.7 Chapter 8 on Periodicity. Algorithms for various types of problems related to periodicity are explained. After de ning squares, longest basic functions, and s factorizations are described as basic algorithmic tools. The problems addressed, include nding all maximal repetitions, nding repeats with a xed gap, computing local periods, and nding approximate repetitions. 2.8 Chapters on Mathematical Structures. The last two chapters deal with problems in mathematical structures, which involve words. Walks in sectors of a plane, forms words. Enumeration formulas of various types of walks are presented. Polyominoes, planes, morphic sequences, and automatic sequences are described in details. Conclusion, and Comments The book can be used as a textbook for an advanced course at graduate level. It is a good reference book to keep it. The rst ve chapters can be used a textbook reference for an elementary course on text manipulations. The list of references at the end of the book spans 24 pages. At the end of each chapter, notes on history is provided. Algorithms are described by tools such as pseudo code, diagrams, and examples. They are backed by detailed theoretical analysis. Review6 Computation engineering: applied automata theory and logic Author of Book: Ganesh
/lp/association-for-computing-machinery/review-computation-engineering-applied-automata-theory-and-logic-tbbpQh6R7c