標(biāo)題: Titlebook: Automata, Languages and Programming; 10th Colloquium Barc Josep Diaz Conference proceedings 1983 Springer-Verlag Berlin Heidelberg 1983 Mon [打印本頁] 作者: 外表 時(shí)間: 2025-3-21 16:28
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學(xué)科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: 高興一回 時(shí)間: 2025-3-21 21:36 作者: 蹣跚 時(shí)間: 2025-3-22 02:17 作者: STEER 時(shí)間: 2025-3-22 05:32
,Wirtschaftspolitische Schlu?folgerungen,cess semantics and which is used, following Gerth, as target for the translation of the ADA fragment. Furthermore, some ideas will be presented on a mathematically tractable treatment of fairness in the general framework of processes.作者: Fabric 時(shí)間: 2025-3-22 12:38 作者: indifferent 時(shí)間: 2025-3-22 16:39
https://doi.org/10.1007/978-3-662-07482-4s new constraint, and also for another constraint, induced by the horizontal decomposition: the ...An algorithm is described that performs the decomposition. It uses a new normal form: the .. The link between the horizontal- and the traditional vertical decomposition is explained.作者: 殘忍 時(shí)間: 2025-3-22 19:45 作者: painkillers 時(shí)間: 2025-3-23 01:11
Gesundheitssystem in Deutschland, depth a constant times .. Here the functions .. form an increasing hierarchy coextensive with the primitive recursive functions. The lower bounds match the known upper bounds for these problems, to within a constant factor for depth.作者: Parallel 時(shí)間: 2025-3-23 03:13
Wirtschaftspolitische Schlussfolgerungen,f usual families under usual operations are studied. At the end of the paper we relate the initial index with other complexity measures such as growth functions, rational index and straight-line programs.作者: 有危險(xiǎn) 時(shí)間: 2025-3-23 07:31 作者: 四目在模仿 時(shí)間: 2025-3-23 13:22
Conditional dependencies for horizontal decompositions,s new constraint, and also for another constraint, induced by the horizontal decomposition: the ...An algorithm is described that performs the decomposition. It uses a new normal form: the .. The link between the horizontal- and the traditional vertical decomposition is explained.作者: milligram 時(shí)間: 2025-3-23 17:45
On the relationship of CCS and CSP,terised as the smallest relation satisfying a set of axioms, we find a suitable set of axioms for the failures equivalence relation. This again makes explicit the differences between the two systems, as well as revealing that the semantic models underlying CCS and CSP are comparable.作者: Compassionate 時(shí)間: 2025-3-23 19:27
Lower bounds for constant depth circuits for prefix problems, depth a constant times .. Here the functions .. form an increasing hierarchy coextensive with the primitive recursive functions. The lower bounds match the known upper bounds for these problems, to within a constant factor for depth.作者: 是限制 時(shí)間: 2025-3-24 00:00
Initial index: A new complexity function for languages,f usual families under usual operations are studied. At the end of the paper we relate the initial index with other complexity measures such as growth functions, rational index and straight-line programs.作者: 強(qiáng)制令 時(shí)間: 2025-3-24 05:59
Behavioural equivalence relations induced by programming logics, is well-known; our treatment differs from the standard one only in that we regard the modalities as specifying intended behaviour instead of being programs. Hennessy-Milner logic is a simplified modal logic which those authors used as a characterisation of their notion of observation equivalence, w作者: Monocle 時(shí)間: 2025-3-24 06:57 作者: 冰雹 時(shí)間: 2025-3-24 10:41
Algebraic specifications with generating constraints,≠FALSE” for bool. This part of hierarchy constraints can be expressed (if necessary) in the axiom part of the specifications. Secondly we give a mechanism how to construct generating constraints and how to translate or reflect them from one part of a specification to other parts. More precisely we d作者: biosphere 時(shí)間: 2025-3-24 18:34 作者: 外向者 時(shí)間: 2025-3-24 22:18 作者: 打包 時(shí)間: 2025-3-25 01:52
,Optimale Vergütung von Leistungserbringern,≠FALSE” for bool. This part of hierarchy constraints can be expressed (if necessary) in the axiom part of the specifications. Secondly we give a mechanism how to construct generating constraints and how to translate or reflect them from one part of a specification to other parts. More precisely we d作者: 不朽中國(guó) 時(shí)間: 2025-3-25 04:35 作者: 希望 時(shí)間: 2025-3-25 10:48 作者: 梯田 時(shí)間: 2025-3-25 13:35 作者: 委托 時(shí)間: 2025-3-25 19:51
https://doi.org/10.1007/978-3-662-07481-7 temporal logic. The proposed proof system allows to reason about .-programs. The proof system is proved to be arithmetically sound and complete in the sense of Harel [H]. The results of the paper generalize a corresponding result of Pnueli.The system decomposes into two parts. The first part allows作者: 參考書目 時(shí)間: 2025-3-25 20:15
,Krankenhausleistungen und ihre Vergütung,sition, nondeterministic choice, recursion and merge (arbitrary interleaving). The first is linear time semantics (LT), stated in terms of trace theory; the semantic domain is the collection of all closed sets of finite and infinite words. The second is branching time semantics (BT), as introduced b作者: Aspirin 時(shí)間: 2025-3-26 01:10 作者: Condyle 時(shí)間: 2025-3-26 07:45 作者: Cardiac 時(shí)間: 2025-3-26 10:00 作者: 使厭惡 時(shí)間: 2025-3-26 14:40
https://doi.org/10.1007/978-3-662-07483-1 nondeterministic state-transition systems. In addition, we compare these relations with other natural state-equivalence relations for nondeterministic systems. We find that the notions of . (Park [P], Ogden [O]) and . (Milner [M]) are very strong equivalences compared with those induced by the logi作者: 火花 時(shí)間: 2025-3-26 18:26
Gesundheitssystem in Deutschland,wo .-bit numbers, and . outputs; the .th output is the carry in the .th position of the sum of the two numbers. We show a nonlinear lower bound for constant-depth, unboundedfanin implementations of prefix-or. However, with negation, linear size circuits are possible. For prefix-carry, we show nonlin作者: 上坡 時(shí)間: 2025-3-26 22:13
Strukturen des Gesundheitssystems, that for each language L over a finite alphabet there exists a finite subset F of L such that for arbitrary morphisms h and g having deciphering delay bounded by p, the equation h(x)=g(x) holds for all x in L if and only if it holds for all x in F.作者: GRACE 時(shí)間: 2025-3-27 01:41 作者: macular-edema 時(shí)間: 2025-3-27 07:41 作者: Arthropathy 時(shí)間: 2025-3-27 12:46 作者: 廣口瓶 時(shí)間: 2025-3-27 14:21
Test sets for morphisms with bounded delay, that for each language L over a finite alphabet there exists a finite subset F of L such that for arbitrary morphisms h and g having deciphering delay bounded by p, the equation h(x)=g(x) holds for all x in L if and only if it holds for all x in F.作者: 隱語 時(shí)間: 2025-3-27 17:56
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166195.jpg作者: ingrate 時(shí)間: 2025-3-28 00:14 作者: Orthodontics 時(shí)間: 2025-3-28 05:49
https://doi.org/10.1007/978-3-662-68457-3The representation of integers in arbitrary number systems is considered. The main emphasis is on problems concerning ambiguity, completeness and equivalence. We develop a rather general automata-theoretic method for solving such, in essence, purely number-theoretic problems. The method seems to be applicable in a variety of different situations.作者: 使混合 時(shí)間: 2025-3-28 06:19
https://doi.org/10.1007/b138054This paper presents an algorithm, that constructs all Voronoi diagrams for k nearest neighbor searching in the Euclidean plane simultaneously. Its space and time complexity of O(N.) is shown to be optimal.作者: Mumble 時(shí)間: 2025-3-28 11:15 作者: 增減字母法 時(shí)間: 2025-3-28 17:41
Herausforderungen an das Gesundheitswesen,Recursive, algebraic and arithmetic strategies for winning generalized Wythoff games in misère play are given. The notion of cedar trees, a subset of binary trees, is introduced and used for consolidating these and the normal play strategies. A connection to generalized Fibonacci searches is indicated.作者: famine 時(shí)間: 2025-3-28 22:09 作者: JEER 時(shí)間: 2025-3-29 01:41 作者: Exonerate 時(shí)間: 2025-3-29 03:30
An O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching,This paper presents an algorithm, that constructs all Voronoi diagrams for k nearest neighbor searching in the Euclidean plane simultaneously. Its space and time complexity of O(N.) is shown to be optimal.作者: Habituate 時(shí)間: 2025-3-29 10:55
Algebraic languages and polyomnoes enumeration,The purpose of this paper is to show the use of algebraic languages theory in solving an open problem in combinatorics : give a formula for the number of convex polyominoes.作者: ABOUT 時(shí)間: 2025-3-29 13:17
Wythoff games, continued fractions, cedar trees and Fibonacci searches,Recursive, algebraic and arithmetic strategies for winning generalized Wythoff games in misère play are given. The notion of cedar trees, a subset of binary trees, is introduced and used for consolidating these and the normal play strategies. A connection to generalized Fibonacci searches is indicated.作者: Anal-Canal 時(shí)間: 2025-3-29 17:59 作者: 噴出 時(shí)間: 2025-3-29 23:41 作者: Aids209 時(shí)間: 2025-3-30 02:50
Automata, Languages and Programming978-3-540-40038-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CORE 時(shí)間: 2025-3-30 06:36
0302-9743 Overview: 978-3-540-12317-0978-3-540-40038-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Biomarker 時(shí)間: 2025-3-30 08:32 作者: preeclampsia 時(shí)間: 2025-3-30 15:56
An axiomatization of the intermittent assertion method using temporal logic, temporal logic. The proposed proof system allows to reason about .-programs. The proof system is proved to be arithmetically sound and complete in the sense of Harel [H]. The results of the paper generalize a corresponding result of Pnueli.The system decomposes into two parts. The first part allows作者: 沉著 時(shí)間: 2025-3-30 17:48 作者: subordinate 時(shí)間: 2025-3-30 21:13
Processes and a fair semantics for the ADA rendez-vous,ions solved by techniques from metric topology as advocated by Nivat. We discuss how such processes can be used to assign meanings to languages with concurrency, culminating in a definition of the ADA rendez-vous. An important intermediate step is a version of Hoare‘s CSP for which we describe a pro作者: 擦試不掉 時(shí)間: 2025-3-31 03:34
Conditional dependencies for horizontal decompositions,relations whose union is the given relation. This horizontal decomposition is based on a new constraint: the .. It indicates how to decompose a relation into two restrictions of this relation. The only difference between the two subrelations is a functional dependency that holds in one subrelation b作者: 勛章 時(shí)間: 2025-3-31 06:54
On the relationship of CCS and CSP,(CSP) developed by Hoare, Brookes and Roscoe. By adapting Milner‘s synchronisation trees to serve as notation for both CCS and CSP, we are able to define a representation mapping for CSP processes. We define an equivalence relation on synchronisation trees which corresponds precisely to the notion o作者: famine 時(shí)間: 2025-3-31 12:29 作者: maroon 時(shí)間: 2025-3-31 16:11
Lower bounds for constant depth circuits for prefix problems,wo .-bit numbers, and . outputs; the .th output is the carry in the .th position of the sum of the two numbers. We show a nonlinear lower bound for constant-depth, unboundedfanin implementations of prefix-or. However, with negation, linear size circuits are possible. For prefix-carry, we show nonlin作者: Epidural-Space 時(shí)間: 2025-3-31 17:48
Test sets for morphisms with bounded delay, that for each language L over a finite alphabet there exists a finite subset F of L such that for arbitrary morphisms h and g having deciphering delay bounded by p, the equation h(x)=g(x) holds for all x in L if and only if it holds for all x in F.作者: Palpitation 時(shí)間: 2025-3-31 22:48 作者: ULCER 時(shí)間: 2025-4-1 04:36
Algebraic specifications with generating constraints, be generated by the operations. In the initial algebraic approach as well as in the loose case with initial restrictions or data constraints this principle is satisfied because of initiality resp. free construction. Actually initiality makes sure that the data under consideration are not only gener作者: Eeg332 時(shí)間: 2025-4-1 09:07
Initial index: A new complexity function for languages,ting the minimal number of states of automata recognizing approximations of a language..The family of polynomial initial languages is defined, and it is proved that it is an intersection-closed A.F.L. The relations between this family and on-line multicounter Turing-machines, Petri-net languages and作者: CROAK 時(shí)間: 2025-4-1 12:44
