Sets for Problem Solving
This chapter provides many examples of how set theory is used to specify problems and algorithms and to characterize precisely domains formed by mathematical entities (e.g., numeric fields) or formed by algorithmic data structures (e.g., by trees).
KeywordsRegular Expression Finite Automaton Horn Clause Program Transformation Start Node
Unable to display preview. Download preview PDF.