Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The combinatorics of some abstract data types M D Atkinson and D Tulley
 

Summary: 1
The combinatorics of some abstract data types
M D Atkinson and D Tulley
School of Mathematical and Computational Sciences,
University of St Andrews, North Haugh,
St Andrews, Fife, KY16 9SS, UK
Abstract
Abstract data types (ADTs) may be regarded as abstract ma-
chines and then a program for an ADT is any sequence of operations
allowed by its specification. The effect of such programs on container
ADTs is captured by the relationship between each input sequence
and the set of possible output sequences that can result from it. This
relationship is studied principally in the case of dictionaries, stacks
and priority queues and a distinction is drawn between ADTs of
unbounded and bounded capacity.
1 Introduction
Abstract machines have a long and honourable history in Computer Sci-
ence. Turing machines, push-down automata, and finite-state machines
are three well known types; they have been used to study general purpose
computers, compilers, and string manipulation although their importance

  

Source: Atkinson, Mike - Department of Computer Science, University of Otago

 

Collections: Computer Technologies and Information Sciences