Titlebook: Mathematical Foundations of Computer Science 2002; 27th International S Krzysztof Diks,Wojciech Rytter Conference proceedings 2002 Springer

鸟场

书目名称Mathematical Foundations of Computer Science 2002影响因子(影响力)




书目名称Mathematical Foundations of Computer Science 2002影响因子(影响力)学科排名




书目名称Mathematical Foundations of Computer Science 2002网络公开度




书目名称Mathematical Foundations of Computer Science 2002网络公开度学科排名




书目名称Mathematical Foundations of Computer Science 2002被引频次




书目名称Mathematical Foundations of Computer Science 2002被引频次学科排名




书目名称Mathematical Foundations of Computer Science 2002年度引用




书目名称Mathematical Foundations of Computer Science 2002年度引用学科排名




书目名称Mathematical Foundations of Computer Science 2002读者反馈




书目名称Mathematical Foundations of Computer Science 2002读者反馈学科排名

排他

A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Appli exponential complexity in the ω-nondeterministic well-structured g.d.-BP1 model for ..This answers an open question from Brosenne, Homeister, and Waack [.], whether the nondeterministic BP1 model is in fact more powerful than the well-structured graph-driven variant.

音的强弱

Matroid Intersections, Polymatroid Inequalities, and Related Problemsor which .(.) ≥ ., and let . = |.|. We show that α ≤ max.,β(log.)/., where . = .(.,β) is the unique positive root of the equation 2.(../logβ - 1) = 1. In particular, our bound implies that α ≤ (.β).. We also give examples of polymatroid functions with arbitrarily large ..,α and β for which α = β(.-.1))log ..

Stress-Fracture

博识

爱哭

Two-Way Finite State Transducers with Nested Pebblese ranges of the .-pebble transducers form a hierarchy with respect to ., their finiteness problem is decidable, and they can be generated by compositions of . macro tree transducers. Related results hold in the nondeterministic case.

爵士乐

打火石

endocardium

0302-9743 ics, combinatorial optimization, graph theory, algorithms, and complexity to programming theory, formal methods, and mathematical logic.978-3-540-44040-6978-3-540-45687-2Series ISSN 0302-9743 Series E-ISSN 1611-3349

刀锋

On Infinite Terms Having a Decidable Monadic Theoryfined by Damm, and recently considered by Courcelle and Knapik: the families of terms obtained by iterating applications of first order substitutions to the set of regular terms. Finally, using second order substitutions yields the same terms.