MATHEMATICAL AUTOMATA THEORY. VOLUME I. FINITE AUTOMATA.

Abstract

Three broad areas were investigated: (1) the use of formal languages to describe the nature and behavior of finite automata; (2) the development of algebraic approaches to the description of finite automata, automata behavior, and the classification of automata; (3) the development of global models (models that, in effect, consider a digital computer as-a-whole) and computability theory. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1965
Accession Number
AD0617404

Entities

People

  • C. C. Elgot
  • Ellen J. Wagner
  • J. Mezei
  • J. Thatcher
  • John Wright

Organizations

  • IBM Thomas J. Watson Research Center

Tags

DTIC Thesaurus Topics

  • Automata
  • Automata Theory
  • Classification
  • Computer Languages
  • Computers
  • Digital Computers
  • Formal Languages
  • Language
  • Words (Language)

Readers

  • Graph Algorithms and Convex Optimization.
  • Theoretical Analysis.