An Algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Libro |
| Lenguaje: | inglés |
| Publicado: |
1979
|
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Order eBook: |
|
| Order Book: | Login to order |
Ejemplares similares: 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.