Zo's Palindromes


Book Description

In Zo's Palindrome's, Derek J. Chin has created over 6,000 palindromes that have sparked interest globally. Professors, teachers, and mathematicians are using this material to increase development of right & left-brain problem-solving skills in students. An extraordinary collection to treasure.




Madam and Nun and 1001


Book Description

Audisee® eBooks with Audio combine professional narration and text highlighting for an engaging read aloud experience! What is a palindrome? Read this book forward or backward to find out! Brian P. Cleary and Brian Gable pair up to wow readers with playful rhymes and eye-catching illustrations that introduce palindromes—words, phrases, or numbers that are spelled the same forward and backward. Each palindrome is printed in color for easy identification. Aha! You found one! Madam and Nun and 1001: What Is a Palindrome? turns traditional grammar lessons on end. Read it aloud and share in the delight of the sense—and nonsense—of words.




Mom and Dad Are Palindromes


Book Description

Bob has a problem. He's a palindrome. In fact, once he learns what a palindrome is, he starts finding palindromes everywhere: his little sis, Nan; his pup, Otto; even his Mom and Dad! It's making Bobfeel like a kook. Is there no escape? Mark Shulman and Adam McCauley have joined forces to create a wonderfully visual, ridiculously clever book of wordplay. Join the hilarity. . . do your civic deed, don't let your pupils slip up, and find the over 101 palindromes hiding in the words and pictures of this zany book. Plus, this is the fixed format version, which will look almost identical to the print version. Additionally for devices that support audio, this ebook includes a read-along setting.




Algebraic Combinatorics on Words


Book Description

Comprehensive 2002 introduction to combinatorics on words for mathematicians and theoretical computer scientists.




So Many Dynamos! and Other Palindromes


Book Description

A collection of palindromes, sentences that read the same forward and backward.




Theoretical Computer Science


Book Description

This book constitutes the refereed proceedings of the 8th FIP WG 2.2 International Conference, TCS 2014, held in Rome, Italy, in September 2014. The 26 revised full papers presented, together with two invited talks, were carefully reviewed and selected from 73 submissions. [Suggestion--please check and add more if needed] TCS-2014 consisted of two tracks, with separate program committees, which dealt respectively with: - Track A: Algorithms, Complexity and Models of Computation, and - Track B: Logic, Semantics, Specification and Verification




Applications of Curves over Finite Fields


Book Description

This volume presents the results of the AMS-IMS-SIAM Joint Summer Research Conference held at the University of Washington (Seattle). The talks were devoted to various aspects of the theory of algebraic curves over finite fields and its numerous applications. The three basic themes are the following: 1. Curves with many rational points. Several articles describe main approaches to the construction of such curves: the Drinfeld modules and fiber product methods, the moduli space approach, and the constructions using classical curves. 2. Monodromy groups of characteristic $p$ covers. A number of authors presented the results and conjectures related to the study of the monodromy groups of curves over finite fields. In particular, they study the monodromy groups from genus 0 covers, reductions of covers, and explicit computation of monodromy groups over finite fields. 3. Zeta functions and trace formulas. To a large extent, papers devoted to this topic reflect the contributions of Professor Bernard Dwork and his students. This conference was the last attended by Professor Dwork before his death, and several papers inspired by his presence include commentaries about the applications of trace formulas and L-function. The volume also contains a detailed introduction paper by Professor Michael Fried, which helps the reader to navigate the material presented in the book.




Theory of Computer Science


Book Description

This Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries. NEW TO THIS EDITION • Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2) • A rigorous proof of Kleene’s theorem (Chapter 5) • Major changes in the chapter on Turing machines (TMs) – A new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and nondeterministic TM • A new chapter (Chapter 10) on decidability and recursively enumerable languages • A new chapter (Chapter 12) on complexity theory and NP-complete problems • A section on quantum computation in Chapter 12. • KEY FEATURES • Objective-type questions in each chapter—with answers provided at the end of the book. • Eighty-three additional solved examples—added as Supplementary Examples in each chapter. • Detailed solutions at the end of the book to chapter-end exercises. The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.




Automata Theory


Book Description

This book covers substantially the central ideas of a one semester course in automata theory. It is oriented towards a mathematical perspective that is understandable to non-mathematicians. Comprehension is greatly aided by many examples, especially on the Chomsky — Schützenberger theorem, which is not found in most books in this field. Special attention is given to semiautomata theory: the relationship between semigroups and sequential machines (including Green's relations), Schützenberger's maximal subgroup, von Neumann inverses, wreath products, transducers using matrix notation, shuffle and Kronecker shuffle products. Methods of formal power series, the ambiguity index and linear languages are discussed. Core material includes finite state automata, regular expressions, Kleene's theorem, Chomsky's hierarchy and transformations of grammars. Ambiguous grammars (not limited to context-free grammars) and modal logics are briefly discussed. Turing machine variants with many examples, pushdown automata and their state transition diagrams and parsers, linear-bounded automata/2-PDA and Kuroda normal form are also discussed. A brief study of Lindenmeyer systems is offered as a comparison to the theory of Chomsky.