Encoding complexities in decision problems of finitely presented combinatorial systems.
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Andere auteurs: | |
| Formaat: | Boek |
| Taal: | Engels |
| Gepubliceerd in: |
Kaiserslautern
1982
|
| Reeks: | Interner Bericht
Nr 57 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|
| Order eBook: |
|
| Order Book: | Login to order |
Gelijkaardige items: Encoding complexities in decision problems of finitely presented combinatorial systems.
- Encoding complexities in decision problems of finitely presented combinatorial systems.
- On finitely generated non-finite Presentations of groups and monoids
- Groups presented by finite two-monadic Church-Rosser Thue systems
- Finitely generated derivation bounded Presentation of groups
- Finite complete Rewriting Systems and the complexity of the word problem.
- Finite complete Rewriting Systems and the complexity of the word problem