An Algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Formaat: | Boek |
| Taal: | Engels |
| Gepubliceerd in: |
1979
|
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|
| Order eBook: |
|
| Order Book: | Login to order |
Gelijkaardige items: An Algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation
- An Algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation.
- On the Quality of pseudo-natural algorithms for the word problem.
- String Matching and algorithmic problems in free groups
- Polynomial Time-Algorithms for the Nielsen reduction and related problems in free groups
- On the Quality of pseudo-natural algorithms for the word problem
- An Extension of propositional logic by algorithmic concepts.