Titlebook: Automata, Languages and Programming; 19th International C W. Kuich Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Autom

cerebellum

書目名稱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é)科排名

抱狗不敢前

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).

剝皮

阻塞

喃喃訴苦

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島

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

完成

邪惡的你

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.

有毒

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.