发布求助
文献互助 智能选刊 最新文献

Colloquium on Trees in Algebra and Programming最新文献

筛选
英文 中文
Graph Matching in Operational Semantics and Typing 操作语义与类型中的图匹配
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_49
Kristoffer Høgsbro Holm
{"title":"Graph Matching in Operational Semantics and Typing","authors":"Kristoffer Høgsbro Holm","doi":"10.1007/3-540-52590-4_49","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_49","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132358732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable 有限值自底向上有限状态树传感器的等价性是可确定的
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_54
H. Seidl
{"title":"Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable","authors":"H. Seidl","doi":"10.1007/3-540-52590-4_54","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_54","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126986775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
More Efficient Bottom-Up Tree Pattern Matching 更有效的自下而上的树模式匹配
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_41
Jiazhen Cai, R. Paige, R. Tarjan
{"title":"More Efficient Bottom-Up Tree Pattern Matching","authors":"Jiazhen Cai, R. Paige, R. Tarjan","doi":"10.1007/3-540-52590-4_41","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_41","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122462673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Towards the Unification of Models for Concurrency 面向并发模型的统一
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_47
G. Ferrari, U. Montanari
{"title":"Towards the Unification of Models for Concurrency","authors":"G. Ferrari, U. Montanari","doi":"10.1007/3-540-52590-4_47","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_47","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129006215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata 不同类型欧米茄自动机之间语言包容与等价的统一表现方法
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_43
E. Clarke, Anca Browne, R. Kurshan
{"title":"A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata","authors":"E. Clarke, Anca Browne, R. Kurshan","doi":"10.1007/3-540-52590-4_43","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_43","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115707334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 48
ML Typability is DEXTIME-Complete ML可Typability是DEXTIME-Complete
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_50
A. Kfoury, J. Tiuryn, P. Urzyczyn
{"title":"ML Typability is DEXTIME-Complete","authors":"A. Kfoury, J. Tiuryn, P. Urzyczyn","doi":"10.1007/3-540-52590-4_50","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_50","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122675119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 38
Combinatory Forms for Equational Programming: Instances, Unification and Narrowing 等式规划的组合形式:实例、统一和缩小
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_39
M. Bellia, M. Bugliesi, M. Occhiuto
{"title":"Combinatory Forms for Equational Programming: Instances, Unification and Narrowing","authors":"M. Bellia, M. Bugliesi, M. Occhiuto","doi":"10.1007/3-540-52590-4_39","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_39","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123106335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
On the Power of Bounded Concurrency II: The Pushdown Automata Level 论有界并发的力量2:下推自动机层次
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_37
T. Hirst, D. Harel
{"title":"On the Power of Bounded Concurrency II: The Pushdown Automata Level","authors":"T. Hirst, D. Harel","doi":"10.1007/3-540-52590-4_37","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_37","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116585272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Coherence of Subsumption 包容的连贯性
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_45
P. Curien, G. Ghelli
{"title":"Coherence of Subsumption","authors":"P. Curien, G. Ghelli","doi":"10.1007/3-540-52590-4_45","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_45","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132531249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 60
Unitary Monoid with Two Generators: An Algorithmic Point of View 具有两个生成器的酉幺正群:一个算法的观点
Colloquium on Trees in Algebra and Programming Pub Date : 1990-05-01 DOI: 10.1007/3-540-52590-4_44
M. Crochemore, Jean Néraud
{"title":"Unitary Monoid with Two Generators: An Algorithmic Point of View","authors":"M. Crochemore, Jean Néraud","doi":"10.1007/3-540-52590-4_44","DOIUrl":"https://doi.org/10.1007/3-540-52590-4_44","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130273873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信