Titlebook: Mathematical Foundations of Computer Science 1990; Banska Bystrica, Cze Branislav Rovan Conference proceedings 1990 Springer-Verlag Berlin

obligation

做作

Mathematical Foundations of Computer Science 1990978-3-540-47185-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

執(zhí)

On kleene algebras and closed semirings,mata theory, and the design and analysis of algorithms. The literature contains at several inequivalent definitions of Kleene algebras and related algebraic structures [2,13,14,5,6,1,9,7]..In this paper we establish some new relationships among these structures. Our main results are:

樹(shù)膠

Canopy

Some properties of zerotesting bounded one-way multicounter machines,chy of zerotesting bounded deterministic counter machine languages. Second, we show that a nondeterministic two-counter machine with 2 zerotests is able to recognize a language which cannot be accepted by any deterministic sublinear zerotesting bounded multicounter machine.

使增至最大

新星

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626124.jpg

FLASK

殺菌劑

庇護(hù)