On the Solvability of a Word Problem for Restricted Semigroups.

Abstract

A class of semigroups called 1-restricted semigroups is defined in which there is at most one relation per generator and at most one occurrence of the generator symbol in any word equivalent to it. The word problem for 1-restricted semigroups is shown to be decidable. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1977
Accession Number
ADA039879

Entities

People

  • Lawrence H Snyder

Organizations

  • Yale University

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Alphabets
  • Computer Science
  • Computers
  • Construction
  • Context Free Grammars
  • Generators
  • Information Systems
  • Military Research
  • Notation
  • Optimization
  • Petri Nets
  • Production
  • Rotation
  • Sequences
  • Terminals
  • Universities

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)