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

信息与控制最新文献

筛选
英文 中文
Optimal parallel pattern matching in strings 字符串中的最佳并行模式匹配
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80028-0
Uzi Vishkin
{"title":"Optimal parallel pattern matching in strings","authors":"Uzi Vishkin","doi":"10.1016/S0019-9958(85)80028-0","DOIUrl":"10.1016/S0019-9958(85)80028-0","url":null,"abstract":"<div><p>Given a text of length <em>n</em> and a pattern of length <em>m</em>, we present a parallel linear algorithm for finding all occurrences of the pattern in the text. The algorithm runs in <em>O</em>(<em>n/p</em>) time using any number of <em>p</em> ⩽ <em>n</em>/log <em>m</em> processors on a concurrent-read concurrent-write parallel random-access-machine.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 91-113"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80028-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90621839","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}
引用次数: 135
Alternation with restrictions on looping 带有循环限制的交替
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80023-1
J.M. Robson
{"title":"Alternation with restrictions on looping","authors":"J.M. Robson","doi":"10.1016/S0019-9958(85)80023-1","DOIUrl":"10.1016/S0019-9958(85)80023-1","url":null,"abstract":"<div><p>Alternating Turing machines with restrictions preventing them from returning to a previous configuration model games with rules enforcing such a restriction, for instance, the Chinese version of Go. Such restrictions do not affect the time complexity of problems for alternating Turing machines but space <em>S</em> on a machine with the restriction is equivalent either to time or to space exponential in <em>S</em> on a normal alternating machine, depending on the precise nature of the restriction.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 2-11"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80023-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79317993","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}
引用次数: 7
There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator 用双向随机磁带发生器进行概率空间的多项式确定性空间模拟是不存在的
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80032-2
Marek Karpinski , Rutger Verbeek
{"title":"There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator","authors":"Marek Karpinski ,&nbsp;Rutger Verbeek","doi":"10.1016/S0019-9958(85)80032-2","DOIUrl":"10.1016/S0019-9958(85)80032-2","url":null,"abstract":"<div><p>We prove there is no polynomial deterministic space simulation for two-way random-tape probabilistic space (Pr<sub>2</sub>SPACE) (as defined in Borodin, A., Cook, S., and Pippenger, N. (1983) <em>Inform. Control</em> <strong>58</strong> 113–136) for all functions <em>f</em>: ℕ → ℕ and all <em>α</em> ∈ ℕ, Pr<sub>2</sub>SPACE(<em>f</em>(<em>n</em>))DSPACE(<em>f</em>(<em>n</em>)<sup><em>α</em></sup>). This is the answer to the problem formulated in op cit., whether the deterministic squared-space simulation (for recognizers and transducers) generalizes to the two-way random-tape machine model. We prove, in fact, a stronger result saying that even space-bounded Las Vegas two-way random-tape algorithms (yielding always the correct answer and terminating with probability 1) are exponentially more efficient than the deterministic ones.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 158-162"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80032-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78624804","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}
引用次数: 9
Some characterizations of multihead finite automata 多头有限自动机的一些性质
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80029-2
Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier
{"title":"Some characterizations of multihead finite automata","authors":"Oscar H. Ibarra,&nbsp;Sam M. Kim,&nbsp;Louis E. Rosier","doi":"10.1016/S0019-9958(85)80029-2","DOIUrl":"10.1016/S0019-9958(85)80029-2","url":null,"abstract":"<div><p>We give characterizations of multihead two-way finite automata in terms of multihead reversal-bounded pushdown automata and restricted checking stack automata. In particular, we show that a language is accepted by a 2<em>k</em>-head two-way finite automaton if and only if it is accepted by a <em>k</em>-head two-way pushdown automaton which makes one reversal on its stack. We also show that a 2-head two-way deterministic finite automaton is equivalent to a simple type of two-way deterministic checking stack automaton. This is in contrast to a previously known result which shows that simple two-way nondeterministic checking stack automata are equivalent to nondeterministic linear bounded automata.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 114-125"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80029-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89663853","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}
引用次数: 5
Optimal parallel algorithms for string matching 字符串匹配的最佳并行算法
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80031-0
Zvi Galil
{"title":"Optimal parallel algorithms for string matching","authors":"Zvi Galil","doi":"10.1016/S0019-9958(85)80031-0","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80031-0","url":null,"abstract":"<div><p>Let WRAM [PRAM]be a parallel computer with <em>p</em> processors (RAMs) which share a common memory and are allowed simultaneous reads and writes [only simultaneous reads]. The only type of simultaneous writes allowed is a simultaneous AND: a subset of the processors may write 0 simultaneously into the same memory cell. Let <em>t</em> be the time bound of the computer. We design below families of parallel algorithms that solve the string matching problem with inputs of size <em>n</em> (<em>n</em> is the sum of lengths of the pattern and the text) and have the following performance in terms of <em>p, t</em> and <em>n</em>: (1) For WRAM: <em>pt</em> = <em>O</em>(<em>n</em>) for <em>p</em> ⩽ <em>n</em>/log <em>n</em> (i.e., <em>t</em> ⩾ log <em>n</em>).<span><sup>†</sup></span> (2) for PRAM: <em>pt</em> = <em>O</em>(<em>n</em>) for <em>p</em> ⩽ <em>n</em>/log<sup>2</sup> <em>n</em> (i.e., <em>t</em> ⩾ log<sup>2</sup> <em>n</em>). (3) For WRAM: <em>t</em> = constant for <em>p</em> = <em>n</em><sup>1 + ε</sup> and any ε &gt; 0. (4) For WRAM: <em>t</em> = <em>O</em>(log <em>n</em>/log log <em>n</em>) for <em>p</em> = <em>n</em>. Similar families are also obtained for the problem of finding all initial palindromes of a given string.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 144-157"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80031-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136515134","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}
引用次数: 0
Fast recognition of pushdown automaton and context-free languages 快速识别下推自动化和上下文无关的语言
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80024-3
Wojciech Rytter
{"title":"Fast recognition of pushdown automaton and context-free languages","authors":"Wojciech Rytter","doi":"10.1016/S0019-9958(85)80024-3","DOIUrl":"10.1016/S0019-9958(85)80024-3","url":null,"abstract":"<div><p>We prove: (1) every language accepted by a two-way nondeterministic pushdown automaton can be recognized on a random access machine in <em>O</em>(<em>n</em><sup>3</sup>/log <em>n</em>) time; (2) every language accepted by a loop-free two-way nondeterministic pushdown automaton can be recognized in <em>O</em>(<em>n</em><sup>3</sup>/log<sup>2</sup> <em>n</em>) time; (3) every context-free language can be recognized on-line in <em>O</em>(<em>n</em><sup>3</sup>/log<sup>2</sup> <em>n</em>) time. We improve the results of Aho, Hopcroft, and Ullman (<em>Inform. Contr.</em> <strong>13</strong>, 1968, 186–206), Rytter (<em>Inform. Process. Lett.</em> <strong>16</strong>, 1983, 127–129), and Graham, Harrison, and Ruzzo (<em>ACM Trans. Programm. Lang. Systems</em> <strong>2</strong>, No. 3, 1980, 415–462).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 12-22"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80024-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87872488","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}
引用次数: 44
The power of the future perfect in program logics 未来的力量完善于程序逻辑
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80025-5
Matthew Hennessy, Colin Stirling
{"title":"The power of the future perfect in program logics","authors":"Matthew Hennessy,&nbsp;Colin Stirling","doi":"10.1016/S0019-9958(85)80025-5","DOIUrl":"10.1016/S0019-9958(85)80025-5","url":null,"abstract":"<div><p>The expressiveness of branching time tense (temporal) logics whose eventually operators are relativised to general paths into the future is investigated. These logics are interpreted in models obtained by generalising the usual notion of transition system to allow infinite transitions. It is shown that the presence of formulae expressing the future perfect enables one to prove that the expressiveness of the logic can be characterised by a notion of bisimulation on the generalised transition systems. The future perfect is obtained by adding a past tense operator to the language. Finally the power of various tense languages from the literature are investigated in this framework.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 23-52"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80025-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77159165","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}
引用次数: 137
AVL-trees for localized search 用于本地化搜索的avl树
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80034-6
Athanasios K. Tsakalidis
{"title":"AVL-trees for localized search","authors":"Athanasios K. Tsakalidis","doi":"10.1016/S0019-9958(85)80034-6","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80034-6","url":null,"abstract":"<div><p>We present a data structure based on AVL-trees which allows an insertion or a deletion to be performed in time <em>O</em>(log <em>d</em>), where <em>d</em> is the distance of the position searched for from a finger which points to the end of the file. Moving a finger to a distance <em>d</em> costs <em>O</em>(log <em>d</em>). This result demonstrates the power of the <em>oldest basic</em> data structure, the AVL-tree. A special case of interest is an efficient implementation of searchable priority queues such that Deletemin requires only <em>constant</em> time.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 173-194"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80034-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136515133","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}
引用次数: 0
Lower time bounds for solving linear diophantine equations on several parallel computational models 求解若干并行计算模型上的线性丢番图方程的下时限
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80035-8
Friedhelm Meyer auf der Heide
{"title":"Lower time bounds for solving linear diophantine equations on several parallel computational models","authors":"Friedhelm Meyer auf der Heide","doi":"10.1016/S0019-9958(85)80035-8","DOIUrl":"10.1016/S0019-9958(85)80035-8","url":null,"abstract":"<div><p>We consider parallel random access machines (PRAM's) with <em>p</em> processors and distributed systems of random access machines (DRAM's) with <em>p</em> processors being partially joint by wires according to a communication graph. For these computational models we prove lower bounds for testing the solvability of linear Diophantine equations and related problems including the knapsack problem. These bounds are achieved by generalizing and simplifying a lower bound for parallel computation trees due to Yao, introducing a new type of computation trees which models computations of DRAM's, and by generalizing a technique used by Paul and Simon and Klein and Meyer auf der Heide to carry over lower bounds from computation trees to RAM's. Thereby we prove that for many problems, <em>p</em> processors cannot speed up a computation by a factor <em>O</em>(<em>p</em>) but only by a factor <em>O</em>(log(<em>p</em> + 1)) and in the case of DRAM's whose communication network has degree <em>c</em> by a factor <em>O</em>(log(<em>c</em> + 1)) only.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 195-211"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80035-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78965233","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}
引用次数: 3
Cumulative subject index volumes 64–67 累积主题索引卷64-67
信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80038-3
{"title":"Cumulative subject index volumes 64–67","authors":"","doi":"10.1016/S0019-9958(85)80038-3","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80038-3","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 224-227"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80038-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136515131","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信