信息与控制 Pub Date : 1984-10-01 DOI: 10.1016/S0019-9958(84)80042-X

J.M. Robson

引用次数: 6

Direction independent context-sensitive grammars 方向无关的上下文敏感语法

信息与控制 Pub Date : 1984-10-01 DOI: 10.1016/S0019-9958(84)80044-3

H.C.M. Kleijn , M. Penttonen , G. Rozenberg , K. Salomaa

引用次数: 4

An upper and lower bound for clock synchronization 时钟同步的上下限

信息与控制 Pub Date : 1984-08-01 DOI: 10.1016/S0019-9958(84)80033-9

Jennifer Lundelius, Nancy Lynch

引用次数: 271

Author index for volume 62 第62卷的作者索引

信息与控制 Pub Date : 1984-08-01 DOI: 10.1016/S0019-9958(84)80036-4

引用次数: 0

Optimal decision trees and one-time-only branching programs for symmetric Boolean functions 对称布尔函数的最优决策树和一次性分支程序

信息与控制 Pub Date : 1984-08-01 DOI: 10.1016/S0019-9958(84)80031-5

Ingo Wegener

引用次数: 32

Alternation bounded auxiliary pushdown automata 交替有界辅助下推自动机

信息与控制 Pub Date : 1984-08-01 DOI: 10.1016/S0019-9958(84)80029-7

Richard E. Ladner , Larry J. Stockmeyer, Richard J. Lipton

引用次数: 15

Functional behavior of nondeterministic and concurrent programs 不确定性和并发程序的功能行为

信息与控制 Pub Date : 1984-08-01 DOI: 10.1016/S0019-9958(84)80032-7

Michael G. Main, David B. Benson

{"title":"Functional behavior of nondeterministic and concurrent programs","authors":"Michael G. Main, David B. Benson","doi":"10.1016/S0019-9958(84)80032-7","DOIUrl":"10.1016/S0019-9958(84)80032-7","url":null,"abstract":"<div>The functions behavior of a deterministic program segment is a function f:D→D, where D is some set of states for the computation. This notion of functional behavior can be extended to nondeterministic and concurrent programs using techniques from linear algebra. In particular, the functional behavior of a nondeterministic program segment is a linear transformation f:A→A, where A is a free semiring module. Other notions from linear algebra carry over into this setting. For example, weakest preconditions and predicate transformers correspond to well-studied concepts in linear algebra. Using multilinear algebra, programs with tuples of inputs and outputs can be handled. For nondeterministic concurrent programs, the functional behavior is a linear transformation f:A→A, where A is a free semiring algebra. In this case, f may also be an algebra morphism, which indicates that the program involves no interprocess communication. Finally, a model of syntax for programs is studied whose semantics is given using linear algebra. It is shown that in this model, free interpretations (essentially Herbrand universes) do not generally exist.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"62 2","pages":"Pages 144-189"},"PeriodicalIF":0.0,"publicationDate":"1984-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80032-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89890409","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}

引用次数: 14

An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA 一种判定DPDA与线性DPDA等价的中间机技术

信息与控制 Pub Date : 1984-07-01 DOI: 10.1016/S0019-9958(84)80008-X

Yair Itzhaik, Amiram Yehudai

引用次数: 0

Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino 任意与周期性存储方案和平面镶嵌使用一种类型的多项式

信息与控制 Pub Date : 1984-07-01 DOI: 10.1016/S0019-9958(84)80007-8

H.A.G. Wijshoff, J. van Leeuwen

{"title":"Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino","authors":"H.A.G. Wijshoff, J. van Leeuwen","doi":"10.1016/S0019-9958(84)80007-8","DOIUrl":"10.1016/S0019-9958(84)80007-8","url":null,"abstract":"<div>Given N distinct memory modules, the elements of an (infinite) array in storage are distributed such that any set of N elements arranged according to a given data template T can be accessed rapidly in parallel. Array embeddings that allow for this are called skewing schemes and have been studied in connection with vector processing and SIMD machines. In 1975 Shapiro (IEEE Trans. Comput. C-27 (1978), 421–428) proved that there exists a valid skewing scheme for a template T if and only if T tessellates the plane. A conjecture of Shapiro is settled and it is proved that for polyominos P a valid skewing scheme exists if and only if there exists a valid periodic skewing scheme. (Periodicity implies a rapid technique to locate data elements.) The proof shows that when a polyomino P tessellates the plane without rotations or reflections, then it can tessellate the plane periodically, i.e., with the instances of P arranged in a lattice. It is also proved that there is a polynomial time algorithm to decide whether a polyomino tessellates the plane, assuming the polyominos in the tessellation should all have an equal orientation.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"62 1","pages":"Pages 1-25"},"PeriodicalIF":0.0,"publicationDate":"1984-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(84)80007-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78949008","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}

引用次数: 49

Effectively given domains and lambda-calculus models 有效给定域和λ演算模型

信息与控制 Pub Date : 1984-07-01 DOI: 10.1016/S0019-9958(84)80009-1

Paola Giannini, Giuseppe Longo

引用次数: 24

信息与控制最新文献