Presents easily accessible coverage of language theory, concentrating on the major properties of the fundamental and automata models for languages. Focuses on practical applications such as finite automata and pattern matching, regular expressions and text editing, extended context-free grammars, and syntax diagrams. Simple and elegant proofs are given for theorems usually considered difficult (e.g., Parikh's theorem or the proof that every finite automata has an equivalent regular expression). Provides algorithms in a Pascal-like notation which complement discussions of constructions and programming. Each chapter includes a springboard section introducing topics for further investigation. Also provides short exercises and programming projects plus extensive examples.

Theory of Computation

Science & Math

Wood, Derrick

Wood, Derick

Mathematics

HarperCollins, Publishers

<p>Consistently using a framework of abstract data types, this book describes all the important data structures and the algorithms that act upon them. The book has two underlying goals: to present the techniques necessary to analyze the performance of data structures and algorithms and to describe the methods used to determine the good and bad features of data structures.</p>

Data Structures, Algorithms, and Performance

Computers & Technology

Programming

Addison-Wesley

Paradigms and programming with PASCAL

Computer Science Press

A Further Note on Top-down Deterministic Languages

History

Palala Press

Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. The authors explore the properties of this generalized convexity in multidimensional Euclidean space, and describ restricted-orientation analogs of lines, hyperplanes, flats, halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. They then introduce the notion of strong restricted-orientation convexity, which is an alternative generalization of convexity, and show that its properties are also similar to that of standard convexity.

Restricted-Orientation Convexity (Monographs in Theoretical Computer Science. An EATCS Series)

Fink, Eugene

Computer Science

Springer

<p>Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. The authors explore the properties of this generalized convexity in multidimensional Euclidean space, and describ restricted-orientation analogs of lines, hyperplanes, flats, halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. They then introduce the notion of strong restricted-orientation convexity, which is an alternative generalization of convexity, and show that its properties are also similar to that of standard convexity. </p>

See the best price to sell, buy, or rent books by Wood, Derick. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Wood, Derick