Skip to content
VuFind
  • 0 Items in e-Shelf (Full)
  • History
  • User Account
  • Logout
  • User Account
  • Help
    • English
    • Deutsch
  • Books & more
  • Articles & more
  • JuSER
Advanced
 
  • Literature Request
  • Cite this
  • Email this
  • Export
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
    • Export to MARC
    • Export to MARCXML
    • Export to BibTeX
  • Favorites
  • Add to e-Shelf Remove from e-Shelf
Cover Image

An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation.

Saved in:
Personal Name(s): Avenhaus, J.
Madlener, K.
Imprint: Kaiserslautern : Universitaet Kaiserslautern, 1979.
Physical Description: 17 S.
Note: englisch
Series Title: Interner Bericht / Universität Kaiserslautern Fachbereich Informatik ; Vol 0016.
Classification:
MFD - Group theory, representation theory
MDF - Formal languages, coding theory
  • Holdings
  • Staff View

ZB
Open Stacks Call Number: S 005967-0016'01 Barcode: 1087003905 Available   

  • Forschungszentrum Jülich
  • Central Library (ZB)
  • Powered by VuFind 6.1.1
Loading...