Computations with rational subsets of confluent groups

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

21 Scopus citations

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
Pages207-212
Number of pages6
DOIs
StatePublished - 1984
Event3rd International Symposium on Symbolic and Algebraic Computation, 1984 - Cambridge, United Kingdom
Duration: 9 Jul 198411 Jul 1984

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume174 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Symposium on Symbolic and Algebraic Computation, 1984
Country/TerritoryUnited Kingdom
CityCambridge
Period9/07/8411/07/84

Fingerprint

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

Cite this