Linear Realization of Finite Automata.

Abstract

The paper presents a method for linear realization of automata when such exist. The basic tools employed are indexed partitions (as a way of writing certain mappings) and predecessor operations. The indexed partitions are studied in some detail and their connection to codes is explained. The method itself is simple and straightforward and contains no search steps. Only standard techniques of linear algebra, such as solving linear equations, are used. Examples are given to show the advantage of this method as compared with previously known ones. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1972
Accession Number
AD0750757

Entities

People

  • Bernd Reusch

Organizations

  • University of Iowa

Tags

DTIC Thesaurus Topics

  • Algebra
  • Automata
  • Equations
  • Linear Algebra
  • Standards

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Graph Algorithms and Convex Optimization.
  • Psychometric Testing or Psychological Assessment.