Computations with rational subsets of confluent groups

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Various problems involving rational subsets of finitely generated free groups can be solved efficiently using a technique related to coset enumeration. We investigate the extension of this method to other finitely generated groups.

Original languageEnglish
Title of host publicationEUROSAM 1984 - International Symposium on Symbolic and Algebraic Computation
EditorsJohn Fitch
PublisherSpringer Verlag
Pages207-212
Number of pages6
ISBN (Print)9783540133506
DOIs
StatePublished - 1984
Event3rd International Symposium on Symbolic and Algebraic Computation, 1984 - Cambridge, United Kingdom
Duration: Jul 9 1984Jul 11 1984

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume174 LNCS

Conference

Conference3rd International Symposium on Symbolic and Algebraic Computation, 1984
Country/TerritoryUnited Kingdom
CityCambridge
Period7/9/847/11/84

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Computations with rational subsets of confluent groups'. Together they form a unique fingerprint.

Cite this