An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kaiserslautern
1979
|
| Schriftenreihe: | Interner Bericht / Fachbereich Informatik, Universität Kaiserslautern
16 |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV003629784 | ||
| 003 | DE-604 | ||
| 005 | 20111128 | ||
| 007 | t | ||
| 008 | 900725s1979 |||| 00||| eng d | ||
| 035 | |a (OCoLC)45910722 | ||
| 035 | |a (DE-599)BVBBV003629784 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 |a DE-19 |a DE-20 | ||
| 084 | |a SI 715 |0 (DE-625)143182: |2 rvk | ||
| 100 | 1 | |a Avenhaus, Jürgen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation |c J. Avenhaus ; K. Madlener |
| 264 | 1 | |a Kaiserslautern |c 1979 | |
| 300 | |a 17 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Interner Bericht / Fachbereich Informatik, Universität Kaiserslautern |v 16 | |
| 700 | 1 | |a Madlener, Klaus |e Verfasser |4 aut | |
| 810 | 2 | |a Fachbereich Informatik, Universität Kaiserslautern |t Interner Bericht |v 16 |w (DE-604)BV000003819 |9 16 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002312319 | ||
Datensatz im Suchindex
| _version_ | 1804117983372509184 |
|---|---|
| any_adam_object | |
| author | Avenhaus, Jürgen Madlener, Klaus |
| author_facet | Avenhaus, Jürgen Madlener, Klaus |
| author_role | aut aut |
| author_sort | Avenhaus, Jürgen |
| author_variant | j a ja k m km |
| building | Verbundindex |
| bvnumber | BV003629784 |
| classification_rvk | SI 715 |
| ctrlnum | (OCoLC)45910722 (DE-599)BVBBV003629784 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01045nam a2200289 cb4500</leader><controlfield tag="001">BV003629784</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111128 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900725s1979 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)45910722</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV003629784</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 715</subfield><subfield code="0">(DE-625)143182:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Avenhaus, Jürgen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation</subfield><subfield code="c">J. Avenhaus ; K. Madlener</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kaiserslautern</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Interner Bericht / Fachbereich Informatik, Universität Kaiserslautern</subfield><subfield code="v">16</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Madlener, Klaus</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Informatik, Universität Kaiserslautern</subfield><subfield code="t">Interner Bericht</subfield><subfield code="v">16</subfield><subfield code="w">(DE-604)BV000003819</subfield><subfield code="9">16</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002312319</subfield></datafield></record></collection> |
| id | DE-604.BV003629784 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T16:03:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002312319 |
| oclc_num | 45910722 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-20 |
| owner_facet | DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-20 |
| physical | 17 S. |
| publishDate | 1979 |
| publishDateSearch | 1979 |
| publishDateSort | 1979 |
| record_format | marc |
| series2 | Interner Bericht / Fachbereich Informatik, Universität Kaiserslautern |
| spelling | Avenhaus, Jürgen Verfasser aut An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation J. Avenhaus ; K. Madlener Kaiserslautern 1979 17 S. txt rdacontent n rdamedia nc rdacarrier Interner Bericht / Fachbereich Informatik, Universität Kaiserslautern 16 Madlener, Klaus Verfasser aut Fachbereich Informatik, Universität Kaiserslautern Interner Bericht 16 (DE-604)BV000003819 16 |
| spellingShingle | Avenhaus, Jürgen Madlener, Klaus An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation |
| title | An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation |
| title_auth | An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation |
| title_exact_search | An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation |
| title_full | An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation J. Avenhaus ; K. Madlener |
| title_fullStr | An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation J. Avenhaus ; K. Madlener |
| title_full_unstemmed | An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation J. Avenhaus ; K. Madlener |
| title_short | An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation |
| title_sort | an algorithm for the word problem in hnn extensions and the dependence of its complexity on the group representation |
| volume_link | (DE-604)BV000003819 |
| work_keys_str_mv | AT avenhausjurgen analgorithmforthewordprobleminhnnextensionsandthedependenceofitscomplexityonthegrouprepresentation AT madlenerklaus analgorithmforthewordprobleminhnnextensionsandthedependenceofitscomplexityonthegrouprepresentation |