標(biāo)題: Titlebook: Automata, Languages and Programming; Ninth Colloquium Aar Mogens Nielsen,Erik Meineche Schmidt Conference proceedings 1982 Springer-Verlag [打印本頁] 作者: 人工合成 時(shí)間: 2025-3-21 17:48
書目名稱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é)科排名
作者: Matrimony 時(shí)間: 2025-3-21 22:58
On-the-fly garbage collection: New algorithms inspired by program proofs,e DLMSS algorithm. In (2), the color gray is introduced so that what we call BW(i, j, k) will always be false. Later this was found to be untenable and the invariants underwent modifications until correct ones were found. Rather than tinker with the invariants, we took the opportunity to look for ch作者: 過份 時(shí)間: 2025-3-22 00:43
Algebraic specifications for parametrized data types with minimal parameter and target algebras, σ-algebras which serve as parameters..We focus attention on one particular method of algebraically specifying parametrized data types: finite specifications with conditional equations using auxiliary sorts and functions provided with initial algebra semantics..We introduce the concept of an effecti作者: VEST 時(shí)間: 2025-3-22 06:08
,A modification of the λ-calculus as a base for functional programming languages, This operator can be used in such a way that renaming of bound variables in any reduction sequence can be avoided, with the effect that efficient interpreters with comparatively simple machine organization can be designed..Any semantic model of the pure λ-calculus also serves as a model for this mo作者: 知識(shí)分子 時(shí)間: 2025-3-22 10:41
,Extended Chomsky-Schützenberger theorems,sms, incorporating the notion of an equality set. For one-tuples they are a homomorphism and an inverse homomorphism. Homomorphic equality and inverse homomorphic equality operations provide simple and uniform characterizations of the recursively enumerable sets in terms of the regular sets, and of 作者: Retrieval 時(shí)間: 2025-3-22 14:17
Machine inductive inference and language identification, more than n+1 mistakes can be (uniformly effectively) inferred in the limit; whereas, in general, a grammar (generation procedure) with no more than n mistakes cannot; for some classes an infinite sequence of perfectly correct decision procedures can be inferred in the limit, but single grammars wi作者: STANT 時(shí)間: 2025-3-22 18:50 作者: SYN 時(shí)間: 2025-3-22 21:25 作者: 低位的人或事 時(shí)間: 2025-3-23 04:38 作者: cacophony 時(shí)間: 2025-3-23 05:54
Parameter passing commutes with implementation of parameterized data types, as studied in earlier papers..A typical example is the implementation of binary trees ., by strings with brackets ., where . is the common formal parameter part of both parameterized specificitions. Parameter passing means to replace the formal parameter . by an actual parameter like integers . lea作者: Expurgate 時(shí)間: 2025-3-23 10:05 作者: 職業(yè) 時(shí)間: 2025-3-23 15:42 作者: 事與愿違 時(shí)間: 2025-3-23 19:01
Equivalence and membership problems for regular trace languages,作者: aggravate 時(shí)間: 2025-3-24 00:44 作者: 喪失 時(shí)間: 2025-3-24 03:57 作者: Emmenagogue 時(shí)間: 2025-3-24 09:48 作者: 鑲嵌細(xì)工 時(shí)間: 2025-3-24 14:45
Getting Started with Oracle Cloud Free Tiereveloped a good algorithm by setting simplicity of the proof as the primary goal..This simplicity has paid off since we are able to obtain other improved algorithms whose proofs are immediate modifications of the original proof. Much work needs to be done investigating the performance of this and other on-the-fly garbage collection algorithms.作者: 使人煩燥 時(shí)間: 2025-3-24 15:52 作者: 乞討 時(shí)間: 2025-3-24 23:04
On-the-fly garbage collection: New algorithms inspired by program proofs,eveloped a good algorithm by setting simplicity of the proof as the primary goal..This simplicity has paid off since we are able to obtain other improved algorithms whose proofs are immediate modifications of the original proof. Much work needs to be done investigating the performance of this and other on-the-fly garbage collection algorithms.作者: 傳染 時(shí)間: 2025-3-24 23:51
Parameter passing commutes with implementation of parameterized data types, starting with a correct implementation of . by . correct parameter passing from . to . leads to a correct induced implementation of . by . where the induced implementation is an algebraic implementation of actual types as studied in our earlier papers. In other words the following diagram of parameter passing and implementations commutes: ..作者: Exaggerate 時(shí)間: 2025-3-25 03:53 作者: Decline 時(shí)間: 2025-3-25 08:20
Getting Started with Oracle Cloud Free Tiererpreters with comparatively simple machine organization can be designed..Any semantic model of the pure λ-calculus also serves as a model for this modified reduction calculus, which guarantees smooth semantical theories..The Berkling Reduction Language BRL is a new functional programming language based upon this modification.作者: Insul島 時(shí)間: 2025-3-25 13:47
https://doi.org/10.1007/978-1-4842-9493-2 homomorphic equality operations provide simple and uniform characterizations of the recursively enumerable sets in terms of the regular sets, and of classes H(.) in terms of .. These characterizations resemble the Chomsky-Schützenberger theorem for context-free languages.作者: fiscal 時(shí)間: 2025-3-25 16:00 作者: Panther 時(shí)間: 2025-3-25 22:48 作者: judiciousness 時(shí)間: 2025-3-26 02:20
,A modification of the λ-calculus as a base for functional programming languages,erpreters with comparatively simple machine organization can be designed..Any semantic model of the pure λ-calculus also serves as a model for this modified reduction calculus, which guarantees smooth semantical theories..The Berkling Reduction Language BRL is a new functional programming language based upon this modification.作者: 含鐵 時(shí)間: 2025-3-26 06:13 作者: ear-canal 時(shí)間: 2025-3-26 12:10
An automata-theoretic characterization of the OI-hierarchy, We hope that the technics develloped in establishing . will turn out to be useful in further applications, e.g. reducing the equivalence problem of level-n schemes [Da 1] to that of deterministic n-pda‘s (c.f. [Cou], [Gal] for the case n=1).作者: NAG 時(shí)間: 2025-3-26 14:32
Automata, Languages and Programming978-3-540-39308-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: parsimony 時(shí)間: 2025-3-26 20:01 作者: disciplined 時(shí)間: 2025-3-26 22:04
Getting Started with Oracle Cloud Free Tierr with correctness criteria for modular systems. A concept of locality of modular systems is defined; it is a property which “good” modular decompositions should have. The locality of certain kinds of modularization mechanisms is studied, and the results are applied to parameterless procedures.作者: Distribution 時(shí)間: 2025-3-27 02:04
Applying Security in Einstein Analytics,construction to functional spaces and prove that convergence for our metric implies pointwise convergence and uniform convergence for increasing sequences. Finally we prove that decidable elements in infinitary computable CPO‘s are effective limits of computable Cauchy sequences in recursive metric spaces.作者: 遭遇 時(shí)間: 2025-3-27 06:36 作者: engrossed 時(shí)間: 2025-3-27 10:28 作者: 燒瓶 時(shí)間: 2025-3-27 16:39 作者: Euphonious 時(shí)間: 2025-3-27 18:08 作者: 大火 時(shí)間: 2025-3-28 00:43
https://doi.org/10.1007/978-1-4842-9493-2sms, incorporating the notion of an equality set. For one-tuples they are a homomorphism and an inverse homomorphism. Homomorphic equality and inverse homomorphic equality operations provide simple and uniform characterizations of the recursively enumerable sets in terms of the regular sets, and of 作者: expeditious 時(shí)間: 2025-3-28 02:58 作者: 壯觀的游行 時(shí)間: 2025-3-28 10:01
Applying Security in Einstein Analytics,construction to functional spaces and prove that convergence for our metric implies pointwise convergence and uniform convergence for increasing sequences. Finally we prove that decidable elements in infinitary computable CPO‘s are effective limits of computable Cauchy sequences in recursive metric 作者: gratify 時(shí)間: 2025-3-28 13:05 作者: 關(guān)心 時(shí)間: 2025-3-28 17:48 作者: Calculus 時(shí)間: 2025-3-28 22:42
https://doi.org/10.1007/978-1-4842-5200-0 as studied in earlier papers..A typical example is the implementation of binary trees ., by strings with brackets ., where . is the common formal parameter part of both parameterized specificitions. Parameter passing means to replace the formal parameter . by an actual parameter like integers . lea作者: Sleep-Paralysis 時(shí)間: 2025-3-28 23:18
Locality in modular systems,r with correctness criteria for modular systems. A concept of locality of modular systems is defined; it is a property which “good” modular decompositions should have. The locality of certain kinds of modularization mechanisms is studied, and the results are applied to parameterless procedures.作者: 領(lǐng)先 時(shí)間: 2025-3-29 03:10
Approximations of infinitary objects,construction to functional spaces and prove that convergence for our metric implies pointwise convergence and uniform convergence for increasing sequences. Finally we prove that decidable elements in infinitary computable CPO‘s are effective limits of computable Cauchy sequences in recursive metric spaces.作者: 展覽 時(shí)間: 2025-3-29 09:06
Getting Started with SQL and DatabasesFor all n >- 2, we construct a context-free language L. for which we prove the following:作者: Ledger 時(shí)間: 2025-3-29 14:58 作者: 調(diào)味品 時(shí)間: 2025-3-29 18:22
Applying Security in Einstein Analytics,The two main results of the paper are: (1) a fine hierarchy of reversal-bounded counter machine languages; and (2) a tape is better than a pushdown store for twoway machines, in the case where their size is sublinear.作者: 故意 時(shí)間: 2025-3-29 20:11 作者: 上坡 時(shí)間: 2025-3-30 02:31 作者: 反對(duì) 時(shí)間: 2025-3-30 05:15
Fast detection of polyhedral intersections,Methods are given for unifying and extending previous work on detecting polyhedral intersections. The technique of dynamic (vs. static) description is introduced and used to extend previous results. New upper bounds of O(log n) and O(log.n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems.作者: 咯咯笑 時(shí)間: 2025-3-30 11:32 作者: choroid 時(shí)間: 2025-3-30 14:36
Multihead finite state automata am concatenation,The following results are shown :作者: intolerance 時(shí)間: 2025-3-30 19:41
https://doi.org/10.1007/BFb0012751Approximation; Notation; algebra; algorithms; automata; complexity; forcing; grammar; homomorphism; logic; pro作者: 壟斷 時(shí)間: 2025-3-31 00:42 作者: Ceramic 時(shí)間: 2025-3-31 02:20 作者: Paradox 時(shí)間: 2025-3-31 07:13
9樓作者: FECK 時(shí)間: 2025-3-31 12:57
10樓作者: 硬化 時(shí)間: 2025-3-31 14:47
10樓作者: Arrhythmia 時(shí)間: 2025-3-31 20:12
10樓作者: 怪物 時(shí)間: 2025-4-1 00:43
10樓
