 About 1,050 results  books.google.com Notation: h(M) is the height (number of symbols) of 5HS. ... Let PLOSS be the
class of sets recognizable on a deterministic Turing machine simultaneously in
polynomial time and log squared space. ... In fact, the proof we give of the
theorem describes a way to simulate a deterministic pushdown automaton in
small space ... 

 books.google.com First, a language is linear contextfree if and only if it is accepted by a
nondeterministic pushdown store acceptor (pda) ... Applying these results to
Theorem 1 we obtain the following automatatheoretic characterization of the
class of r.e. sets. ... The number of reversals made by each storage tape is
bounded by a constant. 

 books.google.com The Dyck language.Syntax Analysis : Ambiguity and the formal power series, Formal properties of LL(k) and LR(k) grammars.Derivation Langauges : Rewriting systems, Algebraic properties, Canonical derivations, Context sensitivity.Cellular ... 

 books.google.com Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science. 

 books.google.com The hierarchy consists of two classes, and Cr. These classes are distinct because
some pushdown machines recognize nonregular sets. For the online Turing
machine, it is clear that the set [0klk  k an integer} is log ntape recognizable and
so the bound of Theorem 3 is exact. We now wish to ... If it is, start checking the
suceSsive numbers to see if they are one more than the preceding. If and when a
... 

 books.google.com It is possible to formulate each of the two items listed in the above theorem ...
reachability queries on two AOMPDSs whose sizes are polynomial in the size of
M. This gives us the following theorem. ... 6 Applications of AOMPDSs 6.1 Unary
Ordered MultiPush Down Systems The class of Unary Ordered MultiPushdown
... 

 books.google.com This book develops the foundations of the theory and indicates the range of classical and modern applications. The hardcover edition received the prestigious Steele Prize in 1996 for best exposition. 

 books.google.com The logistic thesis arises naturally from the effort to push down the foundations of
mathematlcs to as deep a level as possible. We have seen how these
foundations were established in the real number system, and then how they were
pushed back from the real number system to the ... Since the theory of classes is
an essential part of logic, the idea of reducing mathematics to logic certainly
suggests itself. 

 books.google.com Theorem 1: For every n, the class of realtime n tab pushdown machines with at
most one^tab in each square, J'(n), is equivalent to the class of realtime n ...
Here again we show that M' ' falls behind M' by at most a bounded number of
steps. 

 books.google.com A theorem due to Caucal in [11] states that all (rooted) pattern graphs of finite
degree are “contextfree” according to the definition of Muller and Schupp in ... to
recursively defined specifications in the process algebra PDP (containing “
Pushdown Processes”) as the class of “contextfree graphs”. ... This lemma
contains a bound on the number of finite multisets with k members over a set with
m elements. 

 