Sets for Problem Solving

  • Domenico Cantone
  • Eugenio Omodeo
  • Alberto Policriti
Part of the Monographs in Computer Science book series (MCS)

Abstract

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).

Keywords

Regular Expression Finite Automaton Horn Clause Program Transformation Start Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Domenico Cantone
    • 1
  • Eugenio Omodeo
    • 2
  • Alberto Policriti
    • 3
  1. 1.Dipartimento di Matematica e InformaticaUniversità di CataniaCataniaItaly
  2. 2.Dipartimento di Matematica Pura e ApplicataUniversità di L’AquilaL’AquilaItaly
  3. 3.Dipartimento di Matematica e InformaticaUniversità degli Studi di UdineUdineItaly

Personalised recommendations