RAIRO. Inform. théor.
Volume 15, Number 4, 1981
|Page(s)||355 - 371|
|Published online||01 February 2017|
An algorithm for the word problem in $HNN$ extensions and the dependence of its complexity on the group representation
This article has no abstract.
© AFCET 1981
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.