標題: Titlebook: Automata, Languages and Programming; 24th International C Pierpaolo Degano,Roberto Gorrieri,Alberto Marchett Conference proceedings 1997 Sp [打印本頁] 作者: hector 時間: 2025-3-21 19:58
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網(wǎng)絡公開度
書目名稱Automata, Languages and Programming網(wǎng)絡公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: certain 時間: 2025-3-21 21:18
,Chemisch-toxikologische Erw?gungen, of words are not expressible as components of solutions of word equations. In particular, “the primitiveness” and “the equal length” are such properties, as well as being “any word over a proper subalphabet”.作者: 即席 時間: 2025-3-22 02:12 作者: 充滿裝飾 時間: 2025-3-22 04:41
The expressibility of languages and relations by word equations, of words are not expressible as components of solutions of word equations. In particular, “the primitiveness” and “the equal length” are such properties, as well as being “any word over a proper subalphabet”.作者: 孵卵器 時間: 2025-3-22 12:46 作者: 環(huán)形 時間: 2025-3-22 16:21 作者: Nutrient 時間: 2025-3-22 19:18 作者: 瑣事 時間: 2025-3-22 21:21
Bundesamt für Sicherheit im Gesundheitswesenat the languages recognized by PCD systems in dimension . in finite continuous time are precisely the languages of the .. level of the arithmetical hierarchy. Hence we provide a precise characterization of the computational power of purely rational PCD systems in continuous time according to their dimension and we solve a problem left open by [2].作者: Chronological 時間: 2025-3-23 04:51
Tilings and quasiperiodicity,quasiperiodic tilings, we introduce and study a quasiperiodicity function and prove that it is bounded by .?.+. if and only if the considered tiling is periodic. At last, we prove that if a tile set can be used to form a quasiperiodic tiling which is . periodic, then it can form an uncountable number of tilings.作者: Heart-Attack 時間: 2025-3-23 06:06
Some bounds on the computational power of piecewise constant derivative systems (extended abstract)at the languages recognized by PCD systems in dimension . in finite continuous time are precisely the languages of the .. level of the arithmetical hierarchy. Hence we provide a precise characterization of the computational power of purely rational PCD systems in continuous time according to their dimension and we solve a problem left open by [2].作者: 外科醫(yī)生 時間: 2025-3-23 12:58 作者: 無價值 時間: 2025-3-23 15:33
Conference proceedings 1997, Italy, in July 1997. ICALP ‘97 celebrated the 25th anniversary of the European Association for Theoretical Computer Science (EATCS), which has sponsored the ICALP meetings since 1972..The volume presents 73 revised full papers selected from a total of 197 submissions. Also included are six invited作者: Ballad 時間: 2025-3-23 19:50
Pierpaolo Degano,Roberto Gorrieri,Alberto Marchett作者: Isthmus 時間: 2025-3-23 23:16
https://doi.org/10.1007/978-3-642-72514-2y, strongly) deep sequences form a proper subclass of the class of weakly (respectively, strongly) deep sequences. The above-mentioned theorem of Juedes, Lathrop, and Lutz is then strengthened by proving that every weakly useful sequence is recursively strongly deep. It follows from these results th作者: aggressor 時間: 2025-3-24 03:21 作者: 死貓他燒焦 時間: 2025-3-24 06:51 作者: Vital-Signs 時間: 2025-3-24 10:48
Computability on the probability measures on the Borel sets of the unit interval,tions, that the definition leads to the expected computability results, that there are other natural definitions inducing the same computability theory and that the theory is embedded smoothly into classical measure theory. As background we consider TTE, Type 2 Theory of Effectivity [KW84, KW85], wh作者: 坦白 時間: 2025-3-24 18:23
,Chemisch-toxikologische Erw?gungen,ilding LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We refer the reader also to our web-pages for more information.作者: 向外才掩飾 時間: 2025-3-24 20:47 作者: 引起 時間: 2025-3-25 01:50 作者: enchant 時間: 2025-3-25 06:58 作者: 蔑視 時間: 2025-3-25 07:58
Klinische Anwendung von GR-DIAL-Klebstoff,ity of the calculus (i.e. every computable element is definable). We address the general problem of providing an operational semantics to calculi for the real numbers. We present a possible solution based on a new representation for the real numbers.作者: beta-carotene 時間: 2025-3-25 14:40 作者: CRACK 時間: 2025-3-25 18:05 作者: 跟隨 時間: 2025-3-25 21:22
Biologie der Melanophorenhormonenitions are applied, for most other uncountable sets, in particular for measures, no generally accepted computability concepts at all ha,ve been available until now. In this contribution we introduce computability on the set . of probability measures on the Borel subsets of the unit interval [0; 1].作者: 開花期女 時間: 2025-3-26 00:11 作者: 情感脆弱 時間: 2025-3-26 04:21 作者: Homocystinuria 時間: 2025-3-26 09:25 作者: carotenoids 時間: 2025-3-26 13:48
Finite loops recognize exactly the regular open languages,tity. This turns out to be the well-studied class of regular open languages. Our proof technique is interesting in itself: we generalize the operation of block product of monoids, which is so useful in the associative case, to the situation where the left factor in the product is non-associative.作者: coddle 時間: 2025-3-26 18:17 作者: 去世 時間: 2025-3-26 23:55 作者: preeclampsia 時間: 2025-3-27 04:05
Automata, Languages and Programming978-3-540-69194-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 籠子 時間: 2025-3-27 05:40
,Chemisch-toxikologische Erw?gungen,ilding LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We refer the reader also to our web-pages for more information.作者: 猛然一拉 時間: 2025-3-27 13:28
Klinische Anwendung von GR-DIAL-Klebstoff,tity. This turns out to be the well-studied class of regular open languages. Our proof technique is interesting in itself: we generalize the operation of block product of monoids, which is so useful in the associative case, to the situation where the left factor in the product is non-associative.作者: 等待 時間: 2025-3-27 16:13 作者: adipose-tissue 時間: 2025-3-27 20:02 作者: 無彈性 時間: 2025-3-28 00:40
Fragestellung, Material und MethodikFor a quarter of a century now, NP-completeness has been computer science‘s favorite paradigm, fad, punching bag, buzzword, alibi, and intellectual export. This paper is a fragmentary commentary on its origins, its nature, its impact, and on the attributes that have made it so pervasive and contagious.作者: impaction 時間: 2025-3-28 04:20 作者: obtuse 時間: 2025-3-28 08:16
,Chemisch-toxikologische Erw?gungen,We show how the constraint propagation process can be naturally explained by means of chaotic iteration.作者: Itinerant 時間: 2025-3-28 14:06 作者: 吵鬧 時間: 2025-3-28 16:29 作者: 機械 時間: 2025-3-28 18:46
Bundesamt für Sicherheit im GesundheitswesenWe study the monadic case of a decision problem know as simultaneous rigid .-unification. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.作者: Crumple 時間: 2025-3-28 23:32
Biologie der MelanophorenhormoneIn [3] we exhibited a simple boolean functions .. in . variables such that:.In this paper we present a simple boolean function .. in . variables such that:.These mean that . and . are incomparable in the context of ordered read-once branching program.作者: Goblet-Cells 時間: 2025-3-29 03:42 作者: Ventricle 時間: 2025-3-29 08:13
,The Wadge-Wagner hierarchy of ω-rational sets,We present a unified treatment of the hierarchy defined by Klaus Wagner for .-rational sets and also introduced in the more general framework of descriptive set theory by William W. Wadge. We show that this hierarchy can be defined by syntactic invariants, using the concept of an .-semigroup.作者: 發(fā)電機 時間: 2025-3-29 14:09 作者: farewell 時間: 2025-3-29 18:46
Enumerative sequences of leaves in rational trees,We prove that any IN-rational sequence .=(..). of non-negative integers satisfying the Kraft strict inequality .is the enumerative sequence of leaves by height of a rational .-ary tree. Particular cases of this result had been previously proven. We give some partial results in the equality case.作者: 糾纏,纏繞 時間: 2025-3-29 23:36
A completion algorithm for codes with bounded synchronization delay,We show that any rational code with bounded synchronization delay is included in a rational maximal code with bounded synchronization delay.作者: harangue 時間: 2025-3-30 02:53 作者: 多產(chǎn)魚 時間: 2025-3-30 04:36
Randomization and nondeterminism are comparable for ordered read-once branching programs,In [3] we exhibited a simple boolean functions .. in . variables such that:.In this paper we present a simple boolean function .. in . variables such that:.These mean that . and . are incomparable in the context of ordered read-once branching program.作者: 脫水 時間: 2025-3-30 10:38 作者: 減震 時間: 2025-3-30 14:10
978-3-540-63165-1Springer-Verlag Berlin Heidelberg 1997作者: 悶熱 時間: 2025-3-30 19:57 作者: 采納 時間: 2025-3-31 00:07 作者: Debility 時間: 2025-3-31 04:06
Tilings and quasiperiodicity,it was introduced for representing quasicrystals and it is also motivated by the study of quasiperiodic words. We prove that if a tile set can tile the plane, then it can tile the plane quasiperiodically — a surprising result that does not hold for periodicity. In order to compare the regularity of 作者: 徹底明白 時間: 2025-3-31 05:03 作者: 單獨 時間: 2025-3-31 10:53 作者: ARCHE 時間: 2025-3-31 15:22
An abstract data type for real numbers,ity of the calculus (i.e. every computable element is definable). We address the general problem of providing an operational semantics to calculi for the real numbers. We present a possible solution based on a new representation for the real numbers.作者: 錯 時間: 2025-3-31 17:52
Recursive computational depth,ure. In particular, Bennett identified the classes of . and . sequences, and showed that the halting problem is strongly deep. Juedes, Lathrop, and Lutz subsequently extended this result by defining the class of . sequences, and proving that every weakly useful sequence is strongly deep..The present作者: 最高峰 時間: 2025-3-31 23:56 作者: VALID 時間: 2025-4-1 02:18
