Fast Language Acceptance by Shrinking Cellular Automata,

Abstract

When bounded cellular automata are used as acceptors for formal languages, the number of time steps required to accept a string sigma is at least true value of sigma, except in certain trivial cases, since the distinguished cell's state after t steps cannot depend on the initial states of the cells at distances > t from it. However, if the automaton is allowed to shrink (i.e., cells are deleted, and their predecessors become directly connected to their successors), language acceptance in less than linear time becomes possible. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1980
Accession Number
ADA086865

Entities

People

  • Angela Y. Wu
  • Azriel Rosenfeld
  • Tsvi Dubitzki

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Artificial Intelligence
  • Automata
  • Computer Science
  • Computer Vision
  • Computers
  • Context Free Grammars
  • Context Sensitive Grammars
  • Formal Languages
  • Grammars
  • Language
  • Maryland
  • Mathematics
  • Scientific Research
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.
  • Oncology