標(biāo)題: Titlebook: Automata, Languages, and Programming; Sixth Colloquium, Gr Hermann A. Maurer Conference proceedings 1979 Springer-Verlag Berlin Heidelberg [打印本頁(yè)] 作者: 斷頭臺(tái) 時(shí)間: 2025-3-21 18:19
書(shū)目名稱Automata, Languages, and Programming影響因子(影響力)
書(shū)目名稱Automata, Languages, and Programming影響因子(影響力)學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Automata, Languages, and Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming被引頻次
書(shū)目名稱Automata, Languages, and Programming被引頻次學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming年度引用
書(shū)目名稱Automata, Languages, and Programming年度引用學(xué)科排名
書(shū)目名稱Automata, Languages, and Programming讀者反饋
書(shū)目名稱Automata, Languages, and Programming讀者反饋學(xué)科排名
作者: Ordnance 時(shí)間: 2025-3-21 22:51
,Sur les mots sans carré définis par un morphisme,cacbabcbac is nonrepetitive. There is no nonrepetitive word of length 4 over a two letter alphabet ; on the contrary, there exist infinite nonrepetitive words over a three letter alphabet. Most of the explicitly known infinite nonrepetitive words are constructed by iteration of a morphism. In this p作者: Aerophagia 時(shí)間: 2025-3-22 04:29
Existential quantifiers in abstract data types,ions and conjunctions of equations. Necessary and sufficient conditions for the existence of terminal algebras are investigated. Furthermore, some advantages of disjunctions and existential quantifiers within the laws are discussed and the usefulness of terminal algebras is demonstrated by a few exa作者: Permanent 時(shí)間: 2025-3-22 06:34 作者: –scent 時(shí)間: 2025-3-22 12:28
Arbitration and queueing under limited shared storage requirements,-valued shared buffer. The algorithm uses a generalized test-and-set instruction, and schedules processes into their critical sections on a first-come, first-serve basis. The method can be extended to accomodate any queueing discipline defined as a function of the system history between consecutive 作者: 職業(yè) 時(shí)間: 2025-3-22 15:52 作者: Stagger 時(shí)間: 2025-3-22 18:31
Proving termination with multiset orderings,proach is to find a . that maps the values of the program variables into some well-founded set, such that the value of the termination function is continually reduced throughout the computation. All too often, the termination functions required are difficult to find and are of a complexity out of pr作者: 平 時(shí)間: 2025-3-22 22:02 作者: 香料 時(shí)間: 2025-3-23 01:38 作者: Hectic 時(shí)間: 2025-3-23 08:42
Strict deterministic languages and controlled rewriting systems, is injective); in some sense, θ generalizes the semi-Dyck simplification. We state :.THEOREM 2 : ". R ... X* . θ(R)". This extends a result of M. Benois [1], also obtained by M. Fliess [10] (using quite different methods)..THEOREM 3 : ". L . A .. . θ(L) ..".This is a reformulation of a result recen作者: 漂浮 時(shí)間: 2025-3-23 12:09 作者: cunning 時(shí)間: 2025-3-23 15:44 作者: Encephalitis 時(shí)間: 2025-3-23 19:57
Gewalt in internationalen Fernsehnachrichten is injective); in some sense, θ generalizes the semi-Dyck simplification. We state :.THEOREM 2 : ". R ... X* . θ(R)". This extends a result of M. Benois [1], also obtained by M. Fliess [10] (using quite different methods)..THEOREM 3 : ". L . A .. . θ(L) ..".This is a reformulation of a result recen作者: Ruptured-Disk 時(shí)間: 2025-3-24 00:44
Gewalt in internationalen Fernsehnachrichtenin terms of the corresponding CF grammars and equations — that each set of equations has at most one solution..It could be promising to experiment with (fragments of) ALGOL 68 in order to better understand the described method, its complexity and feasibility with respect to the two-level programming作者: parasite 時(shí)間: 2025-3-24 02:43 作者: hauteur 時(shí)間: 2025-3-24 06:40 作者: 領(lǐng)導(dǎo)權(quán) 時(shí)間: 2025-3-24 12:11 作者: overrule 時(shí)間: 2025-3-24 18:35
On the homomorphic characterizations of families of languages,作者: 向外供接觸 時(shí)間: 2025-3-24 19:43 作者: Lice692 時(shí)間: 2025-3-25 00:44 作者: 滔滔不絕的人 時(shí)間: 2025-3-25 04:34 作者: 無(wú)能力之人 時(shí)間: 2025-3-25 09:19
Sharing in nondeterminism,d some unnatural consequences due to unrestricted application of the copy-rule. This is achieved by extending the language and modifying the usual β-rule. Then we discuss how to define a correspon ding denotational semantics, establishing in particular the existence of a model which is fully abstract w.r.t. the operational semantics.作者: Obligatory 時(shí)間: 2025-3-25 11:53
Studies in abstract/concrete mappings in proving algorithm correctness,ine constraints on the abstract operations. Correctness at the concrete level is then shown by exhibiting two appropriate mappings, CA (from the concrete state space to the abstract state space) and CE (from the concrete state space to the set of abstract entities).作者: 緊張過(guò)度 時(shí)間: 2025-3-25 16:29
,Sur les mots sans carré définis par un morphisme,aper, we show that it is decidable whether an infinite word over a three letter alphabet obtained by iterating a morphism is nonrepetitive. We also investigate nonrepetitive morphisms, i.e. morphisms preserving nonrepetitive words, and we show that it is decidable whether a morphism (over an arbitrary finite alphabet) is nonrepetitive.作者: 惰性女人 時(shí)間: 2025-3-25 22:52 作者: ACME 時(shí)間: 2025-3-26 00:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166217.jpg作者: 流利圓滑 時(shí)間: 2025-3-26 06:36 作者: 沒(méi)有希望 時(shí)間: 2025-3-26 11:11
Arbitration and queueing under limited shared storage requirements,-valued shared buffer. The algorithm uses a generalized test-and-set instruction, and schedules processes into their critical sections on a first-come, first-serve basis. The method can be extended to accomodate any queueing discipline defined as a function of the system history between consecutive idle periods.作者: FLIP 時(shí)間: 2025-3-26 14:51 作者: 策略 時(shí)間: 2025-3-26 18:28 作者: 名詞 時(shí)間: 2025-3-26 21:05
0302-9743 Overview: 978-3-540-09510-1978-3-540-35168-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 僵硬 時(shí)間: 2025-3-27 01:08
Zusammenfassung der Ergebnisse,ions and conjunctions of equations. Necessary and sufficient conditions for the existence of terminal algebras are investigated. Furthermore, some advantages of disjunctions and existential quantifiers within the laws are discussed and the usefulness of terminal algebras is demonstrated by a few examples.作者: d-limonene 時(shí)間: 2025-3-27 07:16
Inhaltsanalytische Untersuchung,-valued shared buffer. The algorithm uses a generalized test-and-set instruction, and schedules processes into their critical sections on a first-come, first-serve basis. The method can be extended to accomodate any queueing discipline defined as a function of the system history between consecutive idle periods.作者: JIBE 時(shí)間: 2025-3-27 13:22 作者: 災(zāi)禍 時(shí)間: 2025-3-27 16:50 作者: 移植 時(shí)間: 2025-3-27 18:03 作者: 征服 時(shí)間: 2025-3-28 00:29
Zusammenfassung der Ergebnisse,ions and conjunctions of equations. Necessary and sufficient conditions for the existence of terminal algebras are investigated. Furthermore, some advantages of disjunctions and existential quantifiers within the laws are discussed and the usefulness of terminal algebras is demonstrated by a few exa作者: chandel 時(shí)間: 2025-3-28 05:26
Gewalt in internationalen Fernsehnachrichtenguage R. ... X*. Given such a system, f ? g means that f=αv.β and g=αw.β for some i, α in R. , β in X*. The system is said to be . if and only if f ? g ? f′ implies f=f′. Controlled rewriting systems are a special case of . (P. Butzbach [5], 1973), which can be defined as above, with the R.‘s recurs作者: 行乞 時(shí)間: 2025-3-28 08:30 作者: 浸軟 時(shí)間: 2025-3-28 13:53
Gewalt in internationalen Fernsehnachrichtenx" and an equational "semantics". It has been shown that in the case of a repetition-free and regular based two-level grammar one can always solve the equations assigned to each derivation of the resulting CF grammar. This suggests an approach to the parsing problem of two-level grammars based on we作者: nurture 時(shí)間: 2025-3-28 17:00
Zusammenfassung der Ergebnisse,proach is to find a . that maps the values of the program variables into some well-founded set, such that the value of the termination function is continually reduced throughout the computation. All too often, the termination functions required are difficult to find and are of a complexity out of pr作者: 額外的事 時(shí)間: 2025-3-28 22:34
https://doi.org/10.1007/978-3-531-93260-6mentation at the concrete level. The problem of showing that diagrams commute is simplified by the introduction of a set of abstract entities that define constraints on the abstract operations. Correctness at the concrete level is then shown by exhibiting two appropriate mappings, CA (from the concr作者: BLOT 時(shí)間: 2025-3-28 23:18
https://doi.org/10.1007/978-3-531-93260-6he one between generalized definite languages and the definite and reverse definite languages. Characterizations of .-trivial languages are given in terms of their syntactic monoids, various congruence relations, and the (finite) automata which recognize them. Finally, we examine noncounting languag作者: nonradioactive 時(shí)間: 2025-3-29 05:34
https://doi.org/10.1007/3-540-09510-1Automata; Informatik; Language; Text; algorithms; calculus; complexity; formal language; logic; programming作者: Bravado 時(shí)間: 2025-3-29 11:07 作者: Provenance 時(shí)間: 2025-3-29 13:41
Gewalt in internationalen FernsehnachrichtenWe generalize Ginsburg and Rose‘s characterization of g-s-m mappings to the broader family of so-called subsequential functions, introduced by M.P.Schützenberger作者: LAVE 時(shí)間: 2025-3-29 15:45 作者: 禍害隱伏 時(shí)間: 2025-3-29 21:30
Chaucer’s Chicks: Feminism and Falconry in “The Knight’s Tale,” “The Squire’s Tale,” and ers of bird and woman belong to a medieval world obsessed with class and gender markers in its venereal pursuits but challenged by a prioritization of the female bird of prey for its size and strength. Hawking manuals often reiterated misogynistic rhetoric to assert control over the flighty female.作者: 智力高 時(shí)間: 2025-3-30 03:26 作者: omnibus 時(shí)間: 2025-3-30 07:00
Body Temperature Regulation Determines Immune Reactions and Species Longevityrial apoptosis relevant to defective hepatic dietary fat and drug metabolism. The connections between core body temperature defects and autoimmune disease have now become important to determine programmed cell death in many cells and tissues with relevance to the global chronic disease epidemic and species survival.作者: 不容置疑 時(shí)間: 2025-3-30 08:19
Erika Nussberger,Daniel Garciaental goal of increasing throughput. This research work presents the advantages of overprovisioning and describes a general framework and an initial prototype. Initial results with a synthetic benchmark indicate throughput increases of nearly 6% from a staticly assigned, power managed environment and over 30% from an unmanaged environment.作者: Slit-Lamp 時(shí)間: 2025-3-30 13:45 作者: dura-mater 時(shí)間: 2025-3-30 16:39 作者: 伙伴 時(shí)間: 2025-3-31 00:35 作者: BABY 時(shí)間: 2025-3-31 04:54 作者: 現(xiàn)存 時(shí)間: 2025-3-31 06:55
https://doi.org/10.1007/978-94-011-2018-0Dioxin; Recycling; bacteria; combustion; development; ecotoxicity; environment; groundwater; hazard; matrix; p
