A Remark on Two-Dimensional Finite Automata.

Abstract

Let S2-APMOTA (m) be an area-preserving two-dimensional multipass on-line tessellation acceptor over square array input languages whose pass number is bounded by m. It is proved than an open problem 'Is L(2-NA) a subset but not coincident with L(S2-AMPOTA(1)) ?' proposed in a previous paper by Inoue and the present author has a positive solution. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1979
Accession Number
ADA077392

Entities

People

  • Akira Nakamura

Organizations

  • University of Maryland

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Applied Mathematics
  • Automata
  • Computer Languages
  • Computer Science
  • Computers
  • Formal Languages
  • Geometry
  • Language
  • Maryland
  • Mathematics
  • Scientific Research
  • Two Dimensional
  • Universities

Fields of Study

  • Mathematics

Readers

  • Computer Vision.
  • Graph Algorithms and Convex Optimization.
  • Mathematical Modeling and Probability Theory.