Colloquium on Trees in Algebra and Programming最新文献

筛选
英文 中文
A Tree Pattern Matching Algorithm with Reasonable Space Requirements 一种具有合理空间要求的树型模式匹配算法
Colloquium on Trees in Algebra and Programming Pub Date : 1988-03-21 DOI: 10.1007/BFb0026092
J. Burghardt
{"title":"A Tree Pattern Matching Algorithm with Reasonable Space Requirements","authors":"J. Burghardt","doi":"10.1007/BFb0026092","DOIUrl":"https://doi.org/10.1007/BFb0026092","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122645312","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
Trie Partitioning Process: Limiting Distributions 三分区过程:限制分布
Colloquium on Trees in Algebra and Programming Pub Date : 1986-07-01 DOI: 10.1007/BFb0022669
P. Jacquet, M. Régnier
{"title":"Trie Partitioning Process: Limiting Distributions","authors":"P. Jacquet, M. Régnier","doi":"10.1007/BFb0022669","DOIUrl":"https://doi.org/10.1007/BFb0022669","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125826353","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}
引用次数: 101
Membership for Growing Context Sensitive Grammars is Polynomial 增长上下文敏感语法的隶属关系是多项式的
Colloquium on Trees in Algebra and Programming Pub Date : 1986-07-01 DOI: 10.1007/BFb0022661
E. Dahlhaus, Manfred K. Warmuth
{"title":"Membership for Growing Context Sensitive Grammars is Polynomial","authors":"E. Dahlhaus, Manfred K. Warmuth","doi":"10.1007/BFb0022661","DOIUrl":"https://doi.org/10.1007/BFb0022661","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"43 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127126642","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}
引用次数: 1
Random Walks on Trees 树上的随机漫步
Colloquium on Trees in Algebra and Programming Pub Date : 1986-07-01 DOI: 10.1007/BFb0022671
R. Schott
{"title":"Random Walks on Trees","authors":"R. Schott","doi":"10.1007/BFb0022671","DOIUrl":"https://doi.org/10.1007/BFb0022671","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415959","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}
引用次数: 0
On Applications of Algorithmic Logic 论算法逻辑的应用
Colloquium on Trees in Algebra and Programming Pub Date : 1986-07-01 DOI: 10.1007/BFb0022675
G. Mirkowska, A. Salwicki
{"title":"On Applications of Algorithmic Logic","authors":"G. Mirkowska, A. Salwicki","doi":"10.1007/BFb0022675","DOIUrl":"https://doi.org/10.1007/BFb0022675","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129003908","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}
引用次数: 0
Random Walks, Gaussian Processes, and List Structures 随机漫步,高斯过程和列表结构
Colloquium on Trees in Algebra and Programming Pub Date : 1986-03-24 DOI: 10.1007/BFb0022670
G. Louchard
{"title":"Random Walks, Gaussian Processes, and List Structures","authors":"G. Louchard","doi":"10.1007/BFb0022670","DOIUrl":"https://doi.org/10.1007/BFb0022670","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128682012","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}
引用次数: 3
A Categorical Treatment of Pre- and Post Conditions 对前后条件的分类处理
Colloquium on Trees in Algebra and Programming Pub Date : 1986-03-24 DOI: 10.1007/BFb0022654
E. Wagner
{"title":"A Categorical Treatment of Pre- and Post Conditions","authors":"E. Wagner","doi":"10.1007/BFb0022654","DOIUrl":"https://doi.org/10.1007/BFb0022654","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122293790","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
Infinite Trees, Markings and Well Foundedness 无限的树,标记和良好的基础
Colloquium on Trees in Algebra and Programming Pub Date : 1986-03-24 DOI: 10.1007/BFb0022672
Ran Rinat, N. Francez, O. Grumberg
{"title":"Infinite Trees, Markings and Well Foundedness","authors":"Ran Rinat, N. Francez, O. Grumberg","doi":"10.1007/BFb0022672","DOIUrl":"https://doi.org/10.1007/BFb0022672","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130119709","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}
引用次数: 1
Weighted Graphs: A Tool for Logic Programming 加权图:逻辑编程的工具
Colloquium on Trees in Algebra and Programming Pub Date : 1986-03-24 DOI: 10.1007/BFb0022662
P. Devienne, P. Lebègue
{"title":"Weighted Graphs: A Tool for Logic Programming","authors":"P. Devienne, P. Lebègue","doi":"10.1007/BFb0022662","DOIUrl":"https://doi.org/10.1007/BFb0022662","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114853492","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}
引用次数: 12
Classical and Incremental Evaluators for Attribute Grammars 属性语法的经典和增量求值器
Colloquium on Trees in Algebra and Programming Pub Date : 1986-03-24 DOI: 10.1007/BFb0022663
G. Filé
{"title":"Classical and Incremental Evaluators for Attribute Grammars","authors":"G. Filé","doi":"10.1007/BFb0022663","DOIUrl":"https://doi.org/10.1007/BFb0022663","url":null,"abstract":"","PeriodicalId":332808,"journal":{"name":"Colloquium on Trees in Algebra and Programming","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115801402","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学术官方微信