Mathematical Equivalence in a Primitive Ella

Abstract

The mathematical language L is defined, which represents circuits in a primitive subset of Ella containing delays, pairing, CASE (multiplexer) expressions, and recursive or feedback expressions. It is shown how by reduction of expressions in this language to an approximated finite form, equivalence between expressions can be tested in finite time. Great Britain.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1988
Accession Number
ADA203521

Entities

People

  • M. B. Davies

Organizations

  • Royal Signals and Radar Establishment

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Computer Programming
  • Contracts
  • Feedback
  • Foreign Languages
  • Identities
  • Language
  • Law
  • Notation
  • Permutations
  • Procurement
  • Security
  • Sequences
  • Standards
  • Test And Evaluation
  • Waveforms
  • Words (Language)

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.