標(biāo)題: Titlebook: Automata, Languages and Programming; 19th International C W. Kuich Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Autom [打印本頁(yè)] 作者: cerebellum 時(shí)間: 2025-3-21 17:53
書目名稱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 23:19
Semi-commutations and rational expressions,a language closed under a semi-commutation relation to be a rational language and we proved that the equality between the families of rational languages and recognizable languages closed under a semi-commutation relation is true if and only if the semi-commutation is symmetric (i.e a partial commutation).作者: 剝皮 時(shí)間: 2025-3-22 03:53 作者: 阻塞 時(shí)間: 2025-3-22 08:02 作者: 喃喃訴苦 時(shí)間: 2025-3-22 09:18
Wolfgang Greiner,Oliver Damm MPH, B. Sc.cterization of the sets of low instance complexity in terms of reductions to tally sets; it follows that if P ≠ NP, then no set of low instance complexity can be complete for NP with respect to disjunctive reductions or conjunctive reductions.作者: Insul島 時(shí)間: 2025-3-22 13:46
Circuit complexity and the expressive power of generalized first-order formulas,ere this conjecture is established in a special case: It is shown that the conjecture holds for the subclasses of .., ., and . defined by restricting all the numerical predicates occurring in the logical formulas to be either unary relations, or the order relation <.作者: Consequence 時(shí)間: 2025-3-22 21:04 作者: 完成 時(shí)間: 2025-3-22 23:47 作者: 邪惡的你 時(shí)間: 2025-3-23 02:32
Krankenhausleistungen und ihre Effizienz,enerated by quasi-deterministic 0L systems is properly included by the family of 0L languages and properly includes that of D0L languages. A 0L system is effectively determined whether it is quasi-deterministic or not.作者: 有毒 時(shí)間: 2025-3-23 07:49
2 Nutzentheoretische Lebensqualit?tsmessungprovides a natural grammatical characterization of the context-free hypergraph languages of bounded degree. For grammars with the apex property it is not possible to put a bound on the number of nonterminals in the right-hand sides of the productions.作者: 治愈 時(shí)間: 2025-3-23 11:30
Gesundheits?konomische Evaluationenups are in K... (resp. LI ..), in terms of the properties reverse (resp. general) ..-definite. These properties are more general than the properties reverse (general) definite as defined by Heuter. Finally we show that they are decidable.作者: extrovert 時(shí)間: 2025-3-23 16:42
https://doi.org/10.1007/978-3-662-07485-5y . survives. Our analysis is based on the application of Mellin transform techniques to ordinary generating functions, which yields an asymptotic expansion of the ordinary generating function . of .. near its dominant singularity .=1. The application of a simple transfer lemma eventually provides the required asymptotic expansion of .. as . → ∞.作者: PALMY 時(shí)間: 2025-3-23 21:41
Quasi-deterministic 0L systems,enerated by quasi-deterministic 0L systems is properly included by the family of 0L languages and properly includes that of D0L languages. A 0L system is effectively determined whether it is quasi-deterministic or not.作者: recede 時(shí)間: 2025-3-24 00:48 作者: 熱情贊揚(yáng) 時(shí)間: 2025-3-24 04:51
On reverse and general definite tree languages,ups are in K... (resp. LI ..), in terms of the properties reverse (resp. general) ..-definite. These properties are more general than the properties reverse (general) definite as defined by Heuter. Finally we show that they are decidable.作者: Brain-Waves 時(shí)間: 2025-3-24 10:01
The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependey . survives. Our analysis is based on the application of Mellin transform techniques to ordinary generating functions, which yields an asymptotic expansion of the ordinary generating function . of .. near its dominant singularity .=1. The application of a simple transfer lemma eventually provides the required asymptotic expansion of .. as . → ∞.作者: emission 時(shí)間: 2025-3-24 11:50
Conference proceedings 1992amming languages, program specification, transformationand verification, foundations of logic programming, theoryof logical design andlayout, parallel and distributedcomputation, theory of concurrency, andtheory of robotics.The papers in the volume are grouped into thematicpartscorresponding to their order of presentation at ICALP 92.作者: 得意牛 時(shí)間: 2025-3-24 18:23 作者: bromide 時(shí)間: 2025-3-24 20:48
Vechtaer Beitr?ge zur Gerontologiey on the number of heads of the two-way machines, i.e. .(2SUFA(.-heads)) ..(2SUFA(.+l-heads)), and a weaker hierarchy of the one-way machines, i.e. .(1SUFA(.-heads)) ..(1SUFA(2. + 1heads))..Finally, we show that any reasonable class of synchronized pushdown or counter machines accepts all r.e. languages.作者: 不規(guī)則 時(shí)間: 2025-3-24 23:40 作者: DIS 時(shí)間: 2025-3-25 06:32 作者: CLOWN 時(shí)間: 2025-3-25 08:51
New results concerning synchronized finite automata,y on the number of heads of the two-way machines, i.e. .(2SUFA(.-heads)) ..(2SUFA(.+l-heads)), and a weaker hierarchy of the one-way machines, i.e. .(1SUFA(.-heads)) ..(1SUFA(2. + 1heads))..Finally, we show that any reasonable class of synchronized pushdown or counter machines accepts all r.e. languages.作者: 神經(jīng) 時(shí)間: 2025-3-25 14:46
Analytic analysis of algorithms, occupancy problems..These analytic approaches allow an abstract discussion of asymptotic properties of combinatorial structures and schemas while opening the way for automatic analysis of whole classes of combinatorial algorithms.作者: Asparagus 時(shí)間: 2025-3-25 18:03 作者: Indict 時(shí)間: 2025-3-25 21:35 作者: Corroborate 時(shí)間: 2025-3-26 04:13 作者: 搖曳 時(shí)間: 2025-3-26 06:39
https://doi.org/10.1007/b138948and the prover [16], or agreement between the verifier and the prover on some initial truly random string independent of the theorem [1, 2] and thus are not “one-message” proofs. In fact, it has been shown [18] that only languages in BPP have “one-message proofs” and thus, if NP had one-message proo作者: LEERY 時(shí)間: 2025-3-26 08:45
https://doi.org/10.1007/b138948or all x in Σ, where a performs a cyclic permutation of letters in Σ. As regards morphisms of this form, one may check by using a computer/computers that, for our example morphism g, the image word g(a) is of minimal length. This checking becomes feasible by the reason that one may restrict the stud作者: 打擊 時(shí)間: 2025-3-26 15:15 作者: HALL 時(shí)間: 2025-3-26 19:29 作者: mechanism 時(shí)間: 2025-3-26 21:18
How to count quickly and accurately: A unified analysis of probabilistic counting and other related a ..作者: Osteoarthritis 時(shí)間: 2025-3-27 04:33 作者: chapel 時(shí)間: 2025-3-27 06:50
Abelian squares are avoidable on 4 letters,or all x in Σ, where a performs a cyclic permutation of letters in Σ. As regards morphisms of this form, one may check by using a computer/computers that, for our example morphism g, the image word g(a) is of minimal length. This checking becomes feasible by the reason that one may restrict the stud作者: Vsd168 時(shí)間: 2025-3-27 12:41 作者: Ointment 時(shí)間: 2025-3-27 17:30 作者: 同位素 時(shí)間: 2025-3-27 18:52 作者: 多產(chǎn)子 時(shí)間: 2025-3-28 00:47 作者: Jejune 時(shí)間: 2025-3-28 05:48 作者: reject 時(shí)間: 2025-3-28 07:06 作者: Palliation 時(shí)間: 2025-3-28 13:50
https://doi.org/10.1007/b138948irst-order logic. All of the known and conjectured inclusions among these classes have been shown to be equivalent to a single conjecture concerning the form of the formulas required to define the regular languages they contain. (The conjecture states, roughly, that when a formula defines a regular 作者: 辭職 時(shí)間: 2025-3-28 15:23 作者: 喚醒 時(shí)間: 2025-3-28 21:45
https://doi.org/10.1007/b138948in P. and P.. A word is called abelian 2-repetition free, or in short a-2-free, if it does not contain any abelian square as a subword. Let Σ be the four letter alphabet a,b,c,d. We give an example of a uniformly growing endo-morphism g:Σ.→Σ.; with |g(a)|=85; such that the iteration of g yields an a作者: 嘴唇可修剪 時(shí)間: 2025-3-29 02:59 作者: 迷住 時(shí)間: 2025-3-29 04:03
Krankenhausleistungen und ihre Effizienz,nded set of words at every step, where “bounded” means that the cardinality of the set is always less than a given constant. The family of languages generated by quasi-deterministic 0L systems is properly included by the family of 0L languages and properly includes that of D0L languages. A 0L system作者: violate 時(shí)間: 2025-3-29 11:00
https://doi.org/10.1007/978-3-658-14174-5In this case we say the string ....?1 ...a. a. is a . for ...If the lexicographic ordering on the representations is the same as the usual ordering of the integers, we say the numeration system is .. In particular, if ..=1, then the ., obtained via the greedy algorithm, is order-preserving. We prove作者: BUST 時(shí)間: 2025-3-29 11:48 作者: meritorious 時(shí)間: 2025-3-29 17:44
Vechtaer Beitr?ge zur Gerontologieproc)) ..(2SUFA(. + 1-proc)), by studying reduction functions made by two-way deterministic finite automata with a one-way write-only output tape. Consequently for every . > 1, .(2SUFA(.-proc)) has a complete set under 2DFA reductions and is not closed under union or intersection. In contrast, we sh作者: Defiance 時(shí)間: 2025-3-29 22:38
2 Nutzentheoretische Lebensqualit?tsmessung, i.e., that cannot “pass” nodes from nonterminal to nonterminal. This generalizes Double Greibach Normal Form of context-free grammars. Moreover, it provides a natural grammatical characterization of the context-free hypergraph languages of bounded degree. For grammars with the apex property it is 作者: 淡紫色花 時(shí)間: 2025-3-30 00:56
Gesundheits?konomische Evaluationennguages have syntactic semigroups in K. V J. (resp. LI v J.). We give concise combinatorial descriptions of the tree languages whose syntactic semigroups are in K... (resp. LI ..), in terms of the properties reverse (resp. general) ..-definite. These properties are more general than the properties r作者: Custodian 時(shí)間: 2025-3-30 04:32
Wolfgang Greiner,Oliver Damm MPH, B. Sc.h sets reduce. We show even with respect to very flexible reductions that NP cannot have sparse hard sets unless P = NP; an immediate consequence of our results is: If any NP-complete set conjunctively reduces to a sparse set, then P = NP. We also show that any set . that reduces to some sparse set 作者: 線 時(shí)間: 2025-3-30 10:02
5 Der Health Utility Index (HUI)es include all sets in NP. In this paper, we provide evidence that the class UP may fall in the gap between the low and high hierarchies. Using the circuit lower bound techniques of H?stad and Ko, we construct an oracle set relative to which UP is not in any level of the low and high hierarchies. Si作者: faddish 時(shí)間: 2025-3-30 13:49 作者: grounded 時(shí)間: 2025-3-30 18:39
https://doi.org/10.1007/978-3-662-07485-5: In opposition to the common model, we assume a (non-zero) probability .., .<1 that exactly one of the packets involved in a collision of multiplicity . survives. Our analysis is based on the application of Mellin transform techniques to ordinary generating functions, which yields an asymptotic exp作者: 黃瓜 時(shí)間: 2025-3-30 22:12 作者: 不在灌木叢中 時(shí)間: 2025-3-31 01:41
https://doi.org/10.1007/3-540-55719-9Automat; Graph; Symbol; algorithms; automata; complexity; computability; concurrency; formal language; linear作者: 畫布 時(shí)間: 2025-3-31 09:04 作者: 寬敞 時(shí)間: 2025-3-31 11:09 作者: CHIDE 時(shí)間: 2025-3-31 15:03 作者: 機(jī)警 時(shí)間: 2025-3-31 21:16 作者: GLEAN 時(shí)間: 2025-3-31 22:46
Abelian squares are avoidable on 4 letters,in P. and P.. A word is called abelian 2-repetition free, or in short a-2-free, if it does not contain any abelian square as a subword. Let Σ be the four letter alphabet a,b,c,d. We give an example of a uniformly growing endo-morphism g:Σ.→Σ.; with |g(a)|=85; such that the iteration of g yields an a作者: 鞠躬 時(shí)間: 2025-4-1 03:39 作者: 言行自由 時(shí)間: 2025-4-1 08:05
