信息与控制 Pub Date : 1986-07-01 DOI: 10.1016/S0019-9958(86)80022-5

Paolo Atzeni, Nicola M. Morfuni

引用次数: 105

Aggregating inductive expertise 归纳专门知识的聚合

信息与控制 Pub Date : 1986-07-01 DOI: 10.1016/S0019-9958(86)80025-0

Daniel N. Osherson, Michael Stob, Scott Weinstein

引用次数: 36

Deterministic coin tossing with applications to optimal parallel list ranking 确定性抛硬币在最优并行列表排序中的应用

信息与控制 Pub Date : 1986-07-01 DOI: 10.1016/S0019-9958(86)80023-7

Richard Cole , Uzi Vishkin

引用次数: 432

A simplified lower bound for context-free-language recognition 上下文无关语言识别的简化下界

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80048-1

Joel I. Seiferas

引用次数: 13

Author index for volume 69 第69卷作者索引

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80049-3

引用次数: 0

Boundary NLC graph grammars—Basic definitions, normal forms, and complexity 边界NLC图语法-基本定义，标准形式，和复杂性

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80045-6

Grzegorz Rozenberg, Emo Welzl

{"title":"Boundary NLC graph grammars—Basic definitions, normal forms, and complexity","authors":"Grzegorz Rozenberg, Emo Welzl","doi":"10.1016/S0019-9958(86)80045-6","DOIUrl":"10.1016/S0019-9958(86)80045-6","url":null,"abstract":"<div>Node label controlled (NLC) grammars are graph grammars (operating on node labeled undirected graphs) which rewrite single nodes only and establish connections between the embedded graph and the neighbors of the rewritten node on the basis of the labels of the involved nodes only. They define (possibly infinite) languages of undirected node labeled graphs (or, if we just omit the labels, languages of unlabeled graphs). Here we consider a restriction of NLC grammars, so-called boundary NLC (BNLC) grammars, distinguished by the property that whenever in a graph already generated two nodes may be rewritten, then these nodes are not adjacent. The graph languages generated by this type of grammars are called BNLC languages. Although we show that this restriction leads to a smaller class of languages, still enough generative power remains to define interesting graph languages. For example, trees, complete bipartite graphs, maximal outerplanar graphs, k-trees, graphs of bandwidth ⩽k, graphs of cyclic bandwidth ⩽k, graphs of binary tree bandwidth ⩽k, graphs of cutwidth ⩽k (always for a fixed positive integer k) turn out all to be BNLC languages. We prove a number of normal forms for BNLC grammars and then we indicate their usefulness by various applications. In particular, we show that for connected graphs of bounded degree the membership problem for BNLC languages is solvable in deterministic polynomial time.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"69 1","pages":"Pages 136-167"},"PeriodicalIF":0.0,"publicationDate":"1986-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80045-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83614792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 160

Arithmetic theories for computational complexity problems 计算复杂性问题的算术理论

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80041-9

Steve Homer , John Reif

引用次数: 3

On the complexity of inductive inference 论归纳推理的复杂性

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80042-0

Robert P. Daley, Carl H. Smith

引用次数: 34

Categorical combinators 分类组合子

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80047-X

P.-L. Curien

{"title":"Categorical combinators","authors":"P.-L. Curien","doi":"10.1016/S0019-9958(86)80047-X","DOIUrl":"10.1016/S0019-9958(86)80047-X","url":null,"abstract":"<div>Our main aim is to present the connection between λ-calculus and Cartesian closed categories both in an untyped and purely syntactic setting. More specifically we establish a syntactic equivalence theorem between what we call categorical combinatory logic and λ-calculus with explicit products and projections, with β and η-rules as well as with surjective pairing. “Combinatory logic” is of course inspired by Curry's combinatory logic, based on the well-known S, K, I. Our combinatory logic is “categorical” because its combinators and rules are obtained by extracting untyped information from Cartesian closed categories (looking at arrows only, thus forgetting about objects). Compiling λ-calculus into these combinators happens to be natural and provokes only n log n code expansion. Moreover categorical combinatory logic is entirely faithful to β-reduction where combinatory logic needs additional rather complex and unnatural axioms to be. The connection easily extends to the corresponding typed calculi, where typed categorical combinatory logic is a free Cartesian closed category where the notion of terminal object is replaced by the explicit manipulation of applying (a function to its argument) and coupling (arguments to build datas in products). Our syntactic equivalences induce equivalences at the model level. The paper is intended as a mathematical foundation for developing implementations of functional programming languages based on a “categorical abstract machine,” as developed in a companion paper (Cousineau, Curien, and Mauny, in “Proceedings, ACM Conf. on Functional Programming Languages and Computer Architecture,” Nancy, 1985).</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"69 1","pages":"Pages 188-254"},"PeriodicalIF":0.0,"publicationDate":"1986-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80047-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73755667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 108

Solving tree problems on a mesh-connected processor array 在网格连接的处理器阵列上解决树问题

信息与控制 Pub Date : 1986-04-01 DOI: 10.1016/S0019-9958(86)80046-8

Mikhail J. Atallah, Susanne E. Hambrusch

引用次数: 79

信息与控制最新文献