啤酒 发表于 2025-3-23 12:37:20

http://reply.papertrans.cn/24/2354/235398/235398_11.png

Accede 发表于 2025-3-23 15:20:30

Chandrakanta B. Prasan,Joshua N. Danieltailed exposition and for group theory notation as used here and in Chap. 5 see . For example < {., .}; {.} > is a presentation of the infinite cyclic group ℤ, which we will write <., .; .> or just <.> for short.

铁塔等 发表于 2025-3-23 18:30:25

http://reply.papertrans.cn/24/2354/235398/235398_13.png

expdient 发表于 2025-3-23 22:57:39

http://reply.papertrans.cn/24/2354/235398/235398_14.png

阻碍 发表于 2025-3-24 05:30:44

Basic Definitions,A reduction system is generally characterized by a set . of objects together with a (by definition) meaning preserving one-step transformation relation ⇒ on .. Usually this relation is irreflexive.

赦免 发表于 2025-3-24 10:19:28

The Special One-Relator STSs ,, for , > 1 and the Groups ,,,In the author studied a special STS ..:={(.){, showing that [..; ..]is in fact a group but not a context-free group. In Sect 4.2 we presented the simpler STS .. with this property and we will now present the appropriate generalization of both .. and ...

鼓掌 发表于 2025-3-24 13:48:10

https://doi.org/10.1007/978-3-642-61549-8Datenübertragung; Monoid; Transfomation; algorithms; complexity; Übertragung (EDV)

seroma 发表于 2025-3-24 16:49:15

978-3-642-64867-0Springer-Verlag Berlin Heidelberg 1988

Crumple 发表于 2025-3-24 19:53:44

Confluent String Rewriting978-3-642-61549-8Series ISSN 1431-2654 Series E-ISSN 2193-2069

foreign 发表于 2025-3-25 01:06:45

http://reply.papertrans.cn/24/2354/235398/235398_20.png
页: 1 [2] 3 4 5
查看完整版本: Titlebook: Confluent String Rewriting; Matthias Jantzen Textbook 1988 Springer-Verlag Berlin Heidelberg 1988 Datenübertragung.Monoid.Transfomation.al