It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kaiserslautern
1987
|
| Schriftenreihe: | Universität <Kaiserslautern> / Fachbereich Informatik: Interner Bericht
173 |
| Schlagworte: | |
| Beschreibung: | 16 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000719117 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 880314s1987 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)46099495 | ||
| 035 | |a (DE-599)BVBBV000719117 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 | ||
| 084 | |a SI 715 |0 (DE-625)143182: |2 rvk | ||
| 100 | 1 | |a Narendran, Paliath |d 1955- |e Verfasser |0 (DE-588)121124460 |4 aut | |
| 245 | 1 | 0 | |a It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free |c Paliath Narendran ; Friedrich Otto |
| 264 | 1 | |a Kaiserslautern |c 1987 | |
| 300 | |a 16 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Universität <Kaiserslautern> / Fachbereich Informatik: Interner Bericht |v 173 | |
| 650 | 7 | |a Darstellungstheorie |2 swd | |
| 650 | 7 | |a Monoid |2 swd | |
| 810 | 2 | |a Fachbereich Informatik: Interner Bericht |t Universität <Kaiserslautern> |v 173 |w (DE-604)BV000003819 |9 173 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-000449478 | |
Datensatz im Suchindex
| _version_ | 1820868430126907392 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Narendran, Paliath 1955- |
| author_GND | (DE-588)121124460 |
| author_facet | Narendran, Paliath 1955- |
| author_role | aut |
| author_sort | Narendran, Paliath 1955- |
| author_variant | p n pn |
| building | Verbundindex |
| bvnumber | BV000719117 |
| classification_rvk | SI 715 |
| ctrlnum | (OCoLC)46099495 (DE-599)BVBBV000719117 |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV000719117</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">880314s1987 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)46099495</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000719117</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-12</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">Narendran, Paliath</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121124460</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free</subfield><subfield code="c">Paliath Narendran ; Friedrich Otto</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kaiserslautern</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 Bl.</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">Universität <Kaiserslautern> / Fachbereich Informatik: Interner Bericht</subfield><subfield code="v">173</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Darstellungstheorie</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Monoid</subfield><subfield code="2">swd</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fachbereich Informatik: Interner Bericht</subfield><subfield code="t">Universität <Kaiserslautern></subfield><subfield code="v">173</subfield><subfield code="w">(DE-604)BV000003819</subfield><subfield code="9">173</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000449478</subfield></datafield></record></collection> |
| id | DE-604.BV000719117 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T13:24:15Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000449478 |
| oclc_num | 46099495 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 16 Bl. |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| record_format | marc |
| series2 | Universität <Kaiserslautern> / Fachbereich Informatik: Interner Bericht |
| spelling | Narendran, Paliath 1955- Verfasser (DE-588)121124460 aut It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free Paliath Narendran ; Friedrich Otto Kaiserslautern 1987 16 Bl. txt rdacontent n rdamedia nc rdacarrier Universität <Kaiserslautern> / Fachbereich Informatik: Interner Bericht 173 Darstellungstheorie swd Monoid swd Fachbereich Informatik: Interner Bericht Universität <Kaiserslautern> 173 (DE-604)BV000003819 173 |
| spellingShingle | Narendran, Paliath 1955- It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free Darstellungstheorie swd Monoid swd |
| title | It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free |
| title_auth | It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free |
| title_exact_search | It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free |
| title_full | It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free Paliath Narendran ; Friedrich Otto |
| title_fullStr | It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free Paliath Narendran ; Friedrich Otto |
| title_full_unstemmed | It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free Paliath Narendran ; Friedrich Otto |
| title_short | It es decidable in polynomial time whether a monoid presented by a finite weight-reducing and confluent Thue system is torsion-free |
| title_sort | it es decidable in polynomial time whether a monoid presented by a finite weight reducing and confluent thue system is torsion free |
| topic | Darstellungstheorie swd Monoid swd |
| topic_facet | Darstellungstheorie Monoid |
| volume_link | (DE-604)BV000003819 |
| work_keys_str_mv | AT narendranpaliath itesdecidableinpolynomialtimewhetheramonoidpresentedbyafiniteweightreducingandconfluentthuesystemistorsionfree |