Multiset and K-subset transforming systems

被引：0
|
作者：
Nishida, TY [1 ]
机构：
[1] Toyama Prefectural Univ, Fac Engn, Kosugi, Toyama 9390398, Japan
来源：
MULTISET PROCESSING: MATHEMATICAL, COMPUTER SCIENCE, AND MOLECULAR COMPUTING POINTS OF VIEW | 2001年 / 2235卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：255 / 265
页数：11
相关论文
共 50 条
  • [41] NONSPLITTING SUBSET OF PK(K+)
    GITIK, M
    JOURNAL OF SYMBOLIC LOGIC, 1985, 50 (04) : 881 - 894
  • [42] Random hypergraphs and subset systems
    College of Information Technology and Science, Nankai University, Tianjin 300071, China
    不详
    J. Donghua Univ., 2008, 2 (222-224):
  • [43] SL2(k) and a subset of words over k
    Bacher, R
    EUROPEAN JOURNAL OF COMBINATORICS, 2002, 23 (02) : 141 - 147
  • [44] Random Hypergraphs and Subset Systems
    陈德强
    郑洁
    吴笑千
    Journal of Donghua University(English Edition), 2008, (02) : 222 - 224
  • [45] UNION COMPLETE SUBSET SYSTEMS
    VENUGOPALAN, P
    HOUSTON JOURNAL OF MATHEMATICS, 1988, 14 (04): : 583 - 600
  • [46] Membrane Systems and Multiset Approximation: The Cases of Inner and Boundary Rule Application
    Battyanyi, Peter
    Vaszil, Gyorgy
    ROUGH SETS, IJCRS 2019, 2019, 11499 : 239 - 252
  • [47] Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting
    Lazic, Ranko
    Newcomb, Tom
    Roscoe, Bill
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 138 (03) : 61 - 86
  • [48] Type inference for hierarchical multiset structures in rule-based systems
    Aman, Bogdan
    Ciobanu, Gabriel
    INFORMATION SCIENCES, 2021, 580 : 673 - 683
  • [49] Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
    Kanovich, Max
    Kirigin, Tajana Ban
    Nigam, Vivek
    Scedrov, Andre
    Talcott, Carolyn
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2016, 2016, 9884 : 228 - 244
  • [50] Transforming information systems
    Pagliani, P
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, PT 1, PROCEEDINGS, 2005, 3641 : 660 - 670
12345