Cellular Graph Acceptors, 5: Closure Properties of Cellular d-Graph Languages.

Abstract

Cellular d-graph languages are shown to be closed under set theoretic operations, including finite union and intersection; and under geometric operations, including permutation of arc end numbering, concatenation, closure, and formation of line graphs. Determinism is preserved under the set-theoretic operations; but under the geometric operations, determinism is known to be preserved only when the languages are also predicates. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1978
Accession Number
ADA060380

Entities

People

  • Angela Wu

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Air Force
  • Automata
  • Classification
  • Computer Science
  • Computers
  • Graph Theory
  • Language
  • Maryland
  • Mathematics
  • Permutations
  • Scientific Research
  • Universities

Readers

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