標題: Titlebook: Aspects and Prospects of Theoretical Computer Science; 6th International Me Jürgen Dassow,Jozef Kelemen Conference proceedings 1990 Springe [打印本頁] 作者: 近地點 時間: 2025-3-21 18:50
書目名稱Aspects and Prospects of Theoretical Computer Science影響因子(影響力)
書目名稱Aspects and Prospects of Theoretical Computer Science影響因子(影響力)學(xué)科排名
書目名稱Aspects and Prospects of Theoretical Computer Science網(wǎng)絡(luò)公開度
書目名稱Aspects and Prospects of Theoretical Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Aspects and Prospects of Theoretical Computer Science被引頻次
書目名稱Aspects and Prospects of Theoretical Computer Science被引頻次學(xué)科排名
書目名稱Aspects and Prospects of Theoretical Computer Science年度引用
書目名稱Aspects and Prospects of Theoretical Computer Science年度引用學(xué)科排名
書目名稱Aspects and Prospects of Theoretical Computer Science讀者反饋
書目名稱Aspects and Prospects of Theoretical Computer Science讀者反饋學(xué)科排名
作者: synchronous 時間: 2025-3-21 20:42 作者: 哥哥噴涌而出 時間: 2025-3-22 03:13 作者: 提升 時間: 2025-3-22 06:16 作者: 新娘 時間: 2025-3-22 12:01 作者: figment 時間: 2025-3-22 13:35 作者: 有角 時間: 2025-3-22 17:21
https://doi.org/10.1007/3-540-53414-8Computer; Monoid; algorithms; automata; complexity; computer science; petri net; theorem proving; theoretica作者: 細胞膜 時間: 2025-3-23 00:53 作者: Cognizance 時間: 2025-3-23 02:07 作者: inscribe 時間: 2025-3-23 08:09 作者: Lime石灰 時間: 2025-3-23 11:26 作者: 愛國者 時間: 2025-3-23 17:30
Monoids described by pushdown automata,a deterministic pushdown automaton. We prove that this family contains rational monoids, free groups and is closed under finitely generated submonoids and free products. We also consider other families of monoids of the same complexity than (PR)-monoids.作者: Anterior 時間: 2025-3-23 20:29
Aspects and Prospects of Theoretical Computer Science978-3-540-46869-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 噴出 時間: 2025-3-24 00:32 作者: 善于 時間: 2025-3-24 05:06 作者: intricacy 時間: 2025-3-24 09:12
La segnalazione spontanea e i suoi limiti,a deterministic pushdown automaton. We prove that this family contains rational monoids, free groups and is closed under finitely generated submonoids and free products. We also consider other families of monoids of the same complexity than (PR)-monoids.作者: duplicate 時間: 2025-3-24 11:59 作者: 濃縮 時間: 2025-3-24 18:46
La complessità del farmaco naturaleUsing a recent result of G.Asser, an extention of Ackermann-Peter hierarchy of unary primitive recursive functions to string-functions is obtained. The resulting hierarchy classifies the string-functions according to their lexicographical growth.作者: reflection 時間: 2025-3-24 22:09 作者: 匍匐前進 時間: 2025-3-25 02:07 作者: 終止 時間: 2025-3-25 05:07
Jesper Andreasson,Thomas Johanssoney are the Iterative Function Systems developed by Barnsley, the probabilistic finite generators, and probabilistic mutually recursive systems that generalize both former methods. We briefly introduce the formal notion of an image both as a compact set (of black points) and as a measure on Borel set作者: Aspiration 時間: 2025-3-25 10:20
Jesper Andreasson,Thomas Johanssonthat has at least as many processors as M and, for any k>0, let Q(M/2.) be "M‘s 1/2.-size hypercube", which has 1/2. as many processors as M‘s optimum hypercube. The ratio MI/Q(M/2.) is called . 1/2.- .. We show that (a) for every 2-D mesh M, if M‘s 1/2-density≤1.828, then M can be embedded into its作者: CONE 時間: 2025-3-25 13:55
https://doi.org/10.1007/978-3-662-63411-0 and explanatory types of knowledge. We oppose also the symbolic to the numeric view of background knowledge. We discuss then what we see as the seven most difficult topics in background knowledge acquisition, namely the detection of implicit implications, first order logic knowledge representation 作者: ostracize 時間: 2025-3-25 18:47
La segnalazione spontanea e i suoi limiti, of single neurons, neural circuits, symmetric neural networks (Hopfield model), and of Boltzmann machines is investigated and characterized. Corresponding intractability results are mentioned as well. The evidence is presented why discrete neural networks (inclusively Boltzmann machines) are not to作者: 中古 時間: 2025-3-25 21:46
https://doi.org/10.1007/88-470-0479-9ft-to-right reading on a language containing x, which is regular whenever x is so. We present two characterizations of "zig-zag languages". We then consider and compare two possible ways of counting two-way reading on a regular language, and thus, of defining the behaviour of two-way automata. For e作者: intricacy 時間: 2025-3-26 01:29
https://doi.org/10.1007/88-470-0479-9[DATI85] and wellknown algorithms on recognizable tree languages in order to obtain efficient algorithms. We introduce and study derivation proofs to describe the sequences of rules used to reduce a term t in a term t‘ for a given ground rewrite system S and sketch how compute a derivation proof in 作者: Essential 時間: 2025-3-26 06:20
La segnalazione spontanea e i suoi limiti,tance, i.e. an input word is accepted if and only if the number of possible correct computation paths on this input is odd. Several natural problems are shown to be complete for ⊕. under ..-reductions. A consequence is that ⊕. is the ..-analogon of Cook‘s class ., the class of problems ..-reducible 作者: BULLY 時間: 2025-3-26 08:35
Come limitare i rischi da fitoterapici, a theorem. It may happen that F is . or, for some reason, that we fail to prove F. Several theorem proving methods provide different kinds of the so-called "failure formulae". The failure formulae explain why the proof of F failed..This paper illustrates the kind of failure formulae generated by th作者: 闡明 時間: 2025-3-26 14:10
https://doi.org/10.1007/88-470-0479-9nd for individuals, higher types occur in between) can be classified into an infinite syntactic hierarchy: A definition is in the n‘th stage of this hierarchy, a so called rank-n-definition, iff n is an upper bound on the levels of the types occurring in it..We interpret these definitions over finit作者: JAMB 時間: 2025-3-26 18:05 作者: 道學(xué)氣 時間: 2025-3-26 23:23 作者: 廣告 時間: 2025-3-27 02:56
La segnalazione spontanea e i suoi limiti,a deterministic pushdown automaton. We prove that this family contains rational monoids, free groups and is closed under finitely generated submonoids and free products. We also consider other families of monoids of the same complexity than (PR)-monoids.作者: fulcrum 時間: 2025-3-27 08:02 作者: 寬容 時間: 2025-3-27 11:03
https://doi.org/10.1007/88-470-0479-9er we show, that a hierarchy can be characterized with alternating pushdown automata, which we expect to be strict in contrast to a hierarchy with alternating finite automata or alternating space bounded automata. We describe a similar oracle hierarchy over the context-free languages, for which we c作者: cancer 時間: 2025-3-27 17:02 作者: committed 時間: 2025-3-27 19:30
0302-9743 t the Sixth International Meeting of Young Computer Scientists, IMYCS ‘90. The aim of these meetings is threefold: (1) to inform on newest trends, results, and problems in theoretical computer science and related fields through a tutorial and invited lectures delivered by internationally distinguish作者: CAND 時間: 2025-3-28 00:27 作者: 鑒賞家 時間: 2025-3-28 04:11 作者: 牛的細微差別 時間: 2025-3-28 07:12
La segnalazione spontanea e i suoi limiti,nding intractability results are mentioned as well. The evidence is presented why discrete neural networks (inclusively Boltzmann machines) are not to be expected to solve intractable problems more efficiently than other conventional models of computing.作者: 膽汁 時間: 2025-3-28 11:20
https://doi.org/10.1007/88-470-0479-9nsider and compare two possible ways of counting two-way reading on a regular language, and thus, of defining the behaviour of two-way automata. For each one definition, we show the construction of a one-way automaton equivalent in multiplicity to a given two-way automaton, this generalizing Rabin, Scott and Shepherdson‘s Theorem.作者: deciduous 時間: 2025-3-28 17:31
https://doi.org/10.1007/88-470-0479-9describe the sequences of rules used to reduce a term t in a term t‘ for a given ground rewrite system S and sketch how compute a derivation proof in linear time. Moreover, we study the same problem for recognizable tree languages.作者: 卷發(fā) 時間: 2025-3-28 21:00 作者: ingrate 時間: 2025-3-29 00:08 作者: 作嘔 時間: 2025-3-29 04:55
Methods for generating deterministic fractals and image compression,neralize both former methods. We briefly introduce the formal notion of an image both as a compact set (of black points) and as a measure on Borel sets (specifying greyness or colors). We describe the above mentioned systems for image generation, some mathematical properties and discuss the problem of image encoding.作者: orient 時間: 2025-3-29 08:33 作者: 變異 時間: 2025-3-29 14:08
Complexity issues in discrete neurocomputing,nding intractability results are mentioned as well. The evidence is presented why discrete neural networks (inclusively Boltzmann machines) are not to be expected to solve intractable problems more efficiently than other conventional models of computing.作者: Extricate 時間: 2025-3-29 17:18
Two-way reading on words,nsider and compare two possible ways of counting two-way reading on a regular language, and thus, of defining the behaviour of two-way automata. For each one definition, we show the construction of a one-way automaton equivalent in multiplicity to a given two-way automaton, this generalizing Rabin, Scott and Shepherdson‘s Theorem.作者: cringe 時間: 2025-3-29 20:57
Proofs and reachability problem for ground rewrite systems,describe the sequences of rules used to reduce a term t in a term t‘ for a given ground rewrite system S and sketch how compute a derivation proof in linear time. Moreover, we study the same problem for recognizable tree languages.作者: 串通 時間: 2025-3-30 02:51
Learning by conjugate gradients,where N is the number of minimization variables; in our case all the weights in the network. The performance of CG is benchmarked against the performance of the ordinary backpropagation algorithm (BP). We find that CG is considerably faster than BP and that CG is able to perform the learning task with fewer hidden units.作者: exigent 時間: 2025-3-30 07:58 作者: septicemia 時間: 2025-3-30 09:27
,Constructive matching — Explanation based methodology for inductive theorem proving,e methodology we have developed for inductive theorem proving of theorems containing existential quantifiers. We reveal the importance of the failure formula vocabulary for generating of the so called missing lemmas..The paper uses the vocabulary presented in [7].作者: cipher 時間: 2025-3-30 13:42 作者: Anecdote 時間: 2025-3-30 19:49 作者: 難理解 時間: 2025-3-30 20:45 作者: 現(xiàn)實 時間: 2025-3-31 01:07
Hierarchies over the context-free languages,.The principle of the alternation is also transfered to grammars. Hereby we prove, that the hierarchy with alternating context-free grammars is identical with the oracle hierarchy over the context-free languages and that in case of unbounded alternation context-free and context-sensitive grammars have the same power.作者: alabaster 時間: 2025-3-31 08:56
Come limitare i rischi da fitoterapici,e methodology we have developed for inductive theorem proving of theorems containing existential quantifiers. We reveal the importance of the failure formula vocabulary for generating of the so called missing lemmas..The paper uses the vocabulary presented in [7].作者: 不如屎殼郎 時間: 2025-3-31 12:10
https://doi.org/10.1007/88-470-0479-9(2n+3)-definitions characterize DSPACE(exp.(poly)) (here exp.(x) = x, exp.(x)=2...). This extends the results that rank-1-definitions characterize LOGSPACE [Gu83], rank-2-definitions characterize PTIME, rank-3-definitions characterize PSPACE, rank-4-definitions characterize EXPTIME [Go89a].作者: CHOKE 時間: 2025-3-31 16:31
Characterizing complexity classes by higher type,(2n+3)-definitions characterize DSPACE(exp.(poly)) (here exp.(x) = x, exp.(x)=2...). This extends the results that rank-1-definitions characterize LOGSPACE [Gu83], rank-2-definitions characterize PTIME, rank-3-definitions characterize PSPACE, rank-4-definitions characterize EXPTIME [Go89a].作者: 血統(tǒng) 時間: 2025-3-31 18:39
Methods for generating deterministic fractals and image compression,ey are the Iterative Function Systems developed by Barnsley, the probabilistic finite generators, and probabilistic mutually recursive systems that generalize both former methods. We briefly introduce the formal notion of an image both as a compact set (of black points) and as a measure on Borel set作者: GRIN 時間: 2025-4-1 00:37 作者: 大方一點 時間: 2025-4-1 03:22
Seven hard problems in symbolic background knowledge acquisition, and explanatory types of knowledge. We oppose also the symbolic to the numeric view of background knowledge. We discuss then what we see as the seven most difficult topics in background knowledge acquisition, namely the detection of implicit implications, first order logic knowledge representation
