Finite complete Rewriting Systems and the complexity of the word problem
में बचाया:
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | पुस्तक |
| भाषा: | अंग्रेज़ी |
| प्रकाशित: |
1984
|
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
| Order eBook: |
|
| Order Book: | Login to order |
समान संसाधन: Finite complete Rewriting Systems and the complexity of the word problem
- Finite complete Rewriting Systems and the complexity of the word problem.
- Finite complete Rewriting Systems and the complexity of the word problem G. Bauer, F(riedrich) Otto
- A Completion Procedure for globally finite term rewriting systems.
- Encoding complexities in decision problems of finitely presented combinatorial systems.
- N-level rewriting Systems.
- N-Level Rewriting Systems.