Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.
Download
No fulltext has been uploaded.
Book Chapter
| Published
| English
Author
Meer, Klaus;
Ziegler, Martin
Publishing Year
Book Title
Mathematical Foundations of Computer Science 2007
ISBN
LibreCat-ID
Cite this
Meer K, Ziegler M. Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In: Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-74456-6_64
Meer, K., & Ziegler, M. (2007). Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_64
@inbook{Meer_Ziegler_2007, place={Berlin, Heidelberg}, title={Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation}, DOI={10.1007/978-3-540-74456-6_64}, booktitle={Mathematical Foundations of Computer Science 2007}, author={Meer, Klaus and Ziegler, Martin}, year={2007} }
Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.” In Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-74456-6_64.
K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation,” in Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.
Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.” Mathematical Foundations of Computer Science 2007, 2007, doi:10.1007/978-3-540-74456-6_64.
Google Scholar
ISBN Search