NDLI: Using rewriting techniques to solve the generalized word problem in polycyclic groups

Please wait, while we are loading the content...

On the reduction of linear systems of difference equations

A differential-equations approach to functional equivalence

Series solutions of algebraic and differential equations: a comparison of linear and quadratic algebraic convergence

A factorization algorithm for linear ordinary differential equations

An improved Las Vegas primality test

On some computations with dense structured matrices

Inversibility of rational mappings and structural identifiability in automatics

Knuth-Bendix procedure and Buchberger algorithm: a synthesis

Lookup tables, recurrences and complexity

Labeled trees and the efficient computation of derivations

Factoring rational polynomials over the complexes

A new modular algorithm for computation of algebraic number polynomial gcds

A fast, reliable algorithm for calculating Pade´-Hermite forms

Computing with algebraic series

Recovery of algebraic numbers from their p-adic approximations

Solving systems of nonlinear polynomial equations faster

Some results on the defect

Sturm-Habicht sequence

MINION: an environment to organize mathematical problem solving

Can REDUCE be run in parallel?

A code optimization package for REDUCE

A MACSYMA package for the generation and manipulation of chebyshev series

GENCRAY: a portable code generator for cray fortran

Experimenting the Gröbner basis algorithm with the A1PI system

A program generator for efficient evaluation of fourier series

Simplification of real elementary functions

On the risch-norman integration method and its implementation in MAPLE

Symbolic summation with generating functions

Automatic reasoning about numerical stability of rational expressions

Computing the normal forms of matrices depending on parameters

On the castelnuovo regularity for curves

Careful algebraic translations of geometry theorems

Quantifier elimination and the sign variation method for real root isolation

On the computer solution of symmetric homogeneous triangle inequalities

Dense representation of affine coordinate rings of curves with one point at infinity

A parallel implementation of the cylindrical algebraic decomposition algorithm

Massively parallel symbolic computation

Parallel algorithms for hermite normal form of an integer matrix

Using rewriting techniques to solve the generalized word problem in polycyclic groups

A method for enumerating cosets of a group presented by a canonical system

Reduction of group constructions to point stabilizers

Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system

Note on theorem proving strategies for resolution counterparts of non-classical logics

Employing path dissolution to shorten tableaux proofs

Constrained equational reasoning

Resolvents and symmetric functions

Using rewriting techniques to solve the generalized word problem in polycyclic groups

Content Provider	ACM Digital Library
Author	Wi:Gbmann, D. Avenhaus, J.
Abstract	In this paper we apply rewriting techniques to the generalized word problem GWP in polycyclic groups. We assume the group G to be given by a canonical polycyclic string-rewriting system R and consider GWP in G which is defined by GWP(w,U) iff w∈ for w∈ G, finite U⊆G, where is the subgroup of G generated by U. We describe also by a rewrite system S and define a rewrite relation @@@@S,R in such a way that w @@@@S,R λ iff w∈ (λ the empty word). For this rewrite relation we develop different critical pair criteria for @@@@S,R to be λ-confluent, i.e. confluent on the left-congruence class [λ] of @@@@S,R. Using any of these λ-confluence criteria we construct a completion procedure which stops for every input S and computes a λ-confluent rewrite system equivalent to S. This leads to a decision procedure for GWP in G. Thus we give an explicit uniform algorithm for deciding GWP in polycyclic groups and a new proof based almost only on rewriting techniques for the decidability of this problem. Further, we define a rewrite relation @@@@LM,U which is stronger than @@@@S,R. We show that if G is given by a nilpotent string-rewriting system, then by a completion procedure the input U can be transformed into V such that @@@@LM,V is even confluent, not just λ-confluent.
Starting Page	322
Ending Page	337
Page Count	16
File Format	PDF
ISBN	0897913256
DOI	10.1145/74540.74579
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-07-17
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in