Automatic groups and string rewriting

被引：0
|
作者：
Gilman, RH
机构：
来源：
TERM REWRITING | 1995年 / 909卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：127 / 134
页数：8
相关论文
共 50 条
  • [1] Monoid presentations of groups by finite special string-rewriting systems
    Parkes, DW
    Shavrukov, VY
    Thomas, RM
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2004, 38 (03): : 245 - 256
  • [2] Logical string rewriting
    Manca, V
    THEORETICAL COMPUTER SCIENCE, 2001, 264 (01) : 25 - 51
  • [3] String Rewriting Systems
    Trybulec, Michal
    FORMALIZED MATHEMATICS, 2007, 15 (03): : 121 - 126
  • [4] A SPECIALIZED COMPLETION PROCEDURE FOR MONADIC STRING-REWRITING SYSTEMS PRESENTING GROUPS
    MADLENER, K
    NARENDRAN, P
    OTTO, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 279 - 290
  • [5] USING STRING-REWRITING FOR SOLVING THE WORD PROBLEM FOR FINITELY PRESENTED GROUPS
    MADLENER, K
    OTTO, F
    INFORMATION PROCESSING LETTERS, 1987, 24 (05) : 281 - 284
  • [6] Adding constants to string rewriting
    René Thiemann
    Hans Zantema
    Jürgen Giesl
    Peter Schneider-Kamp
    Applicable Algebra in Engineering, Communication and Computing, 2008, 19 : 27 - 38
  • [7] Adding constants to string rewriting
    Thiemann, Rene
    Zantema, Hans
    Giesl, Juergen
    Schneider-Kamp, Peter
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2008, 19 (01) : 27 - 38
  • [8] String rewriting sequential P-systems and regulated rewriting
    Sosík, P
    Freund, R
    DEVELOPMENTS IN LANGUAGE THEORY, 2002, 2295 : 379 - 388
  • [9] GROUPS PRESENTED BY CERTAIN CLASSES OF FINITE LENGTH-REDUCING STRING-REWRITING SYSTEMS
    MADLENER, K
    OTTO, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 256 : 133 - 144
  • [10] String rewriting for double coset systems
    Brown, R
    Ghani, N
    Heyworth, A
    Wensley, CD
    JOURNAL OF SYMBOLIC COMPUTATION, 2006, 41 (05) : 573 - 590
12345