RESEARCH IN THE ALGEBRAIC THEORY OF MACHINES.

Abstract

Research on the theory of finite semigroups and finite state machines proceeded along three general lines: (a) Towards axiomitizing complexity - this being the goal of the work on the fundamental lemma of complexity. (b) Developing lower bounds to complexity in terms of the subsemigroup structure of a semigroup. (c) The development of the theory of p-length for finite semigroups. The report discusses the accomplishments in these three areas to date. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1969
Accession Number
AD0686102

Entities

People

  • John L. Rhodes

Organizations

  • University of California, Berkeley

Tags

Readers

  • Graph Algorithms and Convex Optimization.
  • Technical Research and Report Writing.