首页> 外文OA文献 >Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems

【2h】

Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems

机译：通过地面树重写系统改进流程重写系统层次结构

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Stefan Göller; Anthony Widjaja Lin;
展开▼
作者单位

展开▼
年度 2013
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems [J] . STEFAN GOELLER, ANTHONY WIDJAJA LIN ACM transactions on computational logic . 2014,第4期

机译：通过地面树重写系统完善流程重写系统的层次结构
2. Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems [J] . Franziska Rapp, Aart Middeldorp LIPIcs : Leibniz International Proceedings in Informatics . 2016,第1期

机译：左线性右地重写系统的一阶重写理论自动化
3. Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems [J] . Guillem Godoy, Ashish Tiwari, Rakesh Verma Applicable algebra in engineering, communication and computing . 2004,第1期

机译：通过重写闭包和正确的术语重写系统来表征汇合
4. Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems [C] . Stefan Goeller, Anthony Widjaja Lin CONCUR 2011 - Concurrency theory . 2011

机译：通过地面树重写系统完善流程重写系统的层次结构
5. Sequentially-Closed and Forward-Closed String Rewriting Systems [D] . Zhang, Yu . 2020

机译：依次关闭和转发封闭的字符串重写系统
6. Rewriting Systems and the Modelling of Biological Systems [O] . Jean-Louis Giavitto, Grant Malcolm, Olivier Michel 2004

机译：重写系统和生物系统建模
7. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems [O] . Dauchet Max, Heuillard Thierry, Lescanne Pierre, 1990

机译：有限基础术语重写系统和其他相关术语重写系统的融合的可判定性
8. Within ARM's (Abstract Rewriting Machine's) Reach: Compilation of Left-Linear Rewrite Systems Via Minimal Rewrite Systems; Software engineering rept [R] . Fokkink, W. J., Kamperman, J. F. T., Walters, H. R. 1997

机译：在aRm（抽象重写机）的范围内：通过最小重写系统编译左线性重写系统;软件工程部

Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems

著录项

引文网络

相似文献

相关主题

期刊订阅