An Implicit Function Theorem for Group Equations Generated by a Finite Automation.

Abstract

The study of mathematical semantics involves the study of mappings from a formal language L to a configuration space C. In this paper we consider the special case where L = L(D), D is a finite automaton, C is a group G, and the semantic map is defined by associating each production of D with a group element of G, p approaches theta (P). A sequence of productions would then be mapped to a product of corresponding group elements. When the semantic map is observed on sentences in L(D), we discuss a graph-theoretic method of solving for theta. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1979
Accession Number
ADA078959

Entities

People

  • Philip R. Thrift

Organizations

  • Princeton University

Tags

DTIC Thesaurus Topics

  • Automata
  • Automation
  • Contracts
  • Equations
  • Formal Languages
  • Instructions
  • Language
  • Linguistics
  • Mathematics
  • Military Research
  • Monitoring
  • New Jersey
  • Plastic Explosives
  • Production
  • Security
  • Semantics

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Graph Algorithms and Convex Optimization.

Technology Areas

  • Space