Pub Date : 1985-10-01DOI: 10.1016/S0019-9958(85)80030-9
Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier
In this paper we present some space/time efficient Turing machine algorithms for recognizing some subclasses of DCFLs. In particular, we show that the finite minimal stacking and “simple” strict restricted (a subclass of strict restricted) deterministic pushdown automata (FMS-DPDAs, SSR-DPDAs, respectively) can be simulated by offline Turing machines simultaneously in space S(n) and time n2/S(n) for any tape function S(n) satisfying log n ⩽ S(n) ⩽ n which is constructable in n2/S(n) time. Generalizations are then made for the corresponding classes of 2-way DPDAs.
{"title":"On space and time efficient TM simulations of some restricted classes of PDA's","authors":"Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier","doi":"10.1016/S0019-9958(85)80030-9","DOIUrl":"10.1016/S0019-9958(85)80030-9","url":null,"abstract":"<div><p>In this paper we present some space/time efficient Turing machine algorithms for recognizing some subclasses of DCFLs. In particular, we show that the finite minimal stacking and “simple” strict restricted (a subclass of strict restricted) deterministic pushdown automata (FMS-DPDAs, SSR-DPDAs, respectively) can be simulated by offline Turing machines simultaneously in space <em>S</em>(<em>n</em>) and time <em>n</em><sup>2</sup>/<em>S</em>(<em>n</em>) for any tape function <em>S</em>(<em>n</em>) satisfying log <em>n</em> ⩽ <em>S</em>(<em>n</em>) ⩽ <em>n</em> which is constructable in <em>n</em><sup>2</sup>/<em>S</em>(<em>n</em>) time. Generalizations are then made for the corresponding classes of 2-way DPDAs.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 126-143"},"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)80030-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86954003","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}
Pub Date : 1985-10-01DOI: 10.1016/S0019-9958(85)80033-4
Helge Szwerinski
It is shown that every one-dimensional cellular space with von Neumann neighborhood (each cell connected to its two immediate neighbors) can be simulated in real-time by a cellular space with a symmetrical local transition function with the same neighborhood, and starting with the same configuration. Symmetrical means that the individual cells cannot distinguish between left and right.
{"title":"Symmetrical one-dimensional cellular spaces","authors":"Helge Szwerinski","doi":"10.1016/S0019-9958(85)80033-4","DOIUrl":"10.1016/S0019-9958(85)80033-4","url":null,"abstract":"<div><p>It is shown that every one-dimensional cellular space with von Neumann neighborhood (each cell connected to its two immediate neighbors) can be simulated in real-time by a cellular space with a symmetrical local transition function with the same neighborhood, and starting with the same configuration. Symmetrical means that the individual cells cannot distinguish between left and right.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 163-172"},"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)80033-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84033911","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}
Pub Date : 1985-09-01DOI: 10.1016/S0019-9958(85)80058-9
Jacques Stern
{"title":"Complexity of some problems from the theory of automata","authors":"Jacques Stern","doi":"10.1016/S0019-9958(85)80058-9","DOIUrl":"10.1016/S0019-9958(85)80058-9","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 3","pages":"Pages 163-176"},"PeriodicalIF":0.0,"publicationDate":"1985-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80058-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84176139","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}
Pub Date : 1985-09-01DOI: 10.1016/S0019-9958(85)80056-5
Erich Kaltofen
In this paper we prove by entirely elementary means a very effective version of the Hilbert irreducibility theorem. We then apply our theorem to construct a probabilistic irreducibility test for sparse multivariate polynomials over arbitrary perfect fields. For the usual coefficient fields the test runs in polynomial time in the input size.
{"title":"Effective Hilbert irreducibility","authors":"Erich Kaltofen","doi":"10.1016/S0019-9958(85)80056-5","DOIUrl":"10.1016/S0019-9958(85)80056-5","url":null,"abstract":"<div><p>In this paper we prove by entirely elementary means a very effective version of the Hilbert irreducibility theorem. We then apply our theorem to construct a probabilistic irreducibility test for sparse multivariate polynomials over arbitrary perfect fields. For the usual coefficient fields the test runs in polynomial time in the input size.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 3","pages":"Pages 123-137"},"PeriodicalIF":0.0,"publicationDate":"1985-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80056-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89432582","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}
Pub Date : 1985-09-01DOI: 10.1016/S0019-9958(85)80057-7
Takanori Adachi
We introduce the notion of powerposets which is a natural generalization of that of powersets with inclusion as their partial ordering. We show that every powerposet is an algebraic semilattice and that every continuous poset can be directed—continuously embeddable into some powerposet. We also discuss the possibility of making powerposets into λ-models as in the case of Plotkin-Scott's Pω theory.
{"title":"Powerposets","authors":"Takanori Adachi","doi":"10.1016/S0019-9958(85)80057-7","DOIUrl":"10.1016/S0019-9958(85)80057-7","url":null,"abstract":"<div><p>We introduce the notion of powerposets which is a natural generalization of that of powersets with inclusion as their partial ordering. We show that every powerposet is an algebraic semilattice and that every continuous poset can be directed—continuously embeddable into some powerposet. We also discuss the possibility of making powerposets into <em>λ</em>-models as in the case of Plotkin-Scott's <em>Pω</em> theory.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 3","pages":"Pages 138-162"},"PeriodicalIF":0.0,"publicationDate":"1985-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80057-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91058559","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}
Pub Date : 1985-09-01DOI: 10.1016/S0019-9958(85)80061-9
{"title":"Author index for volume 66","authors":"","doi":"10.1016/S0019-9958(85)80061-9","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80061-9","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 3","pages":"Page 206"},"PeriodicalIF":0.0,"publicationDate":"1985-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80061-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136492836","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}
Pub Date : 1985-09-01DOI: 10.1016/S0019-9958(85)80059-0
Amihood Amir
Little is known about the expressive completeness of connectives in temporal logic systems with a nonlinear time model. We introduce separation—a general tool for proving completeness in nonlinear time models. We then use the separation theorem to show expressive completeness of a finite set of connectives in various branching time models.
{"title":"Separation in nonlinear time models","authors":"Amihood Amir","doi":"10.1016/S0019-9958(85)80059-0","DOIUrl":"10.1016/S0019-9958(85)80059-0","url":null,"abstract":"<div><p>Little is known about the expressive completeness of connectives in temporal logic systems with a nonlinear time model. We introduce <em>separation</em>—a general tool for proving completeness in nonlinear time models. We then use the separation theorem to show expressive completeness of a finite set of connectives in various branching time models.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 3","pages":"Pages 177-203"},"PeriodicalIF":0.0,"publicationDate":"1985-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80059-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75924277","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}
Pub Date : 1985-07-01DOI: 10.1016/S0019-9958(85)80015-2
Dung T. Huynh
In this paper we investigate the computational complexity of the inequivalence problems for commutative grammars. We show that the inequivalence problems for type 0 and context-sensitive commutative grammars are undecidable whereas decidability in nondeterministic exponential-time holds for the classes of regular and context-free commutative grammars. For the latter the inequivalence problems are Σp2-hard.
{"title":"The complexity of equivalence problems for commutative grammars","authors":"Dung T. Huynh","doi":"10.1016/S0019-9958(85)80015-2","DOIUrl":"10.1016/S0019-9958(85)80015-2","url":null,"abstract":"<div><p>In this paper we investigate the computational complexity of the inequivalence problems for commutative grammars. We show that the inequivalence problems for type 0 and context-sensitive commutative grammars are undecidable whereas decidability in nondeterministic exponential-time holds for the classes of regular and context-free commutative grammars. For the latter the inequivalence problems are <em>Σ</em><sup><em>p</em></sup><sub>2</sub>-hard.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 103-121"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80015-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73265310","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}
Pub Date : 1985-07-01DOI: 10.1016/S0019-9958(85)80011-5
Norbert Blum
We construct an N-node graph G which has (i) a layout with area O(N) and maximum edge length O(N1/2), (ii) a layout with area O(N5/4) and maximum edge length O(N1/4). We prove for 1 ≤ f(N) ≤ (O(N1/8) that any layout for G with area Nf(N) has an edge of length Ω(N1/2/f(N)·log N). Hence G has no layout which is optimal with respect to both measures.
{"title":"An area-maximum edge length trade-off for VSLI layout","authors":"Norbert Blum","doi":"10.1016/S0019-9958(85)80011-5","DOIUrl":"10.1016/S0019-9958(85)80011-5","url":null,"abstract":"<div><p>We construct an <em>N</em>-node graph <em>G</em> which has (i) a layout with area <em>O</em>(<em>N</em>) and maximum edge length <em>O</em>(<em>N</em><sup>1/2</sup>), (ii) a layout with area <em>O</em>(<em>N</em><sup>5/4</sup>) and maximum edge length <em>O</em>(<em>N</em><sup>1/4</sup>). We prove for 1 ≤ <em>f</em>(<em>N</em>) ≤ (<em>O</em>(<em>N</em><sup>1/8</sup>) that any layout for <em>G</em> with area <em>Nf</em>(<em>N</em>) has an edge of length <em>Ω</em>(<em>N</em><sup>1/2</sup>/<em>f</em>(<em>N</em>)·log <em>N</em>). Hence <em>G</em> has no layout which is optimal with respect to both measures.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 45-52"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80011-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72862762","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}
Pub Date : 1985-07-01DOI: 10.1016/S0019-9958(85)80009-7
William C. Rounds
We use Scott's idea of information systems to provide a complete partial order semantics for concurrency involving Milner's synchronization tree model. Several connections are investigated between different models; our principal technique in establishing these connections is the use of compact metric space methods.
{"title":"On the relationships between Scott domains, synchronization trees, and metric spaces","authors":"William C. Rounds","doi":"10.1016/S0019-9958(85)80009-7","DOIUrl":"10.1016/S0019-9958(85)80009-7","url":null,"abstract":"<div><p>We use Scott's idea of information systems to provide a complete partial order semantics for concurrency involving Milner's synchronization tree model. Several connections are investigated between different models; our principal technique in establishing these connections is the use of compact metric space methods.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 6-28"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80009-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84830630","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号