Graph Connectivity, Let G be a graph with n > 2 vertices with (n2 - 3n + 4)...

Let G be a graph with n > 2 vertices with (n2 - 3n + 4)/2 edges. Prove that G is connected.

Automata answer, build a TM that enumerate even set of even length string o...

build a TM that enumerate even set of even length string over a

Arden''s theorem,

Binary form and chomsky normal form, Normal forms are important because the...

Normal forms are important because they give us a 'standard' way of rewriting and allow us to compare two apparently different grammars G1  and G2. The two grammars can be shown to

Constract Context free, constract context free g ={ a^n b^m : m,n >=0 and n...

constract context free g ={ a^n b^m : m,n >=0 and n

Strictly local languages, We have now de?ned classes of k-local languages f...

We have now de?ned classes of k-local languages for all k ≥ 2. Together, these classes form the Strictly Local Languages in general. De?nition (Strictly Local Languages) A langu

Computer achitecture, what is a bus and draw a single bus structure

what is a bus and draw a single bus structure

Finiteness problem for regular languages, The fact that the Recognition Pro...

The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length grea

Brain game, If the first three words are the boys down,what are the last th...

If the first three words are the boys down,what are the last three words??

Operations on strictly local languages, The class of Strictly Local Languag...

The class of Strictly Local Languages (in general) is closed under • intersection but is not closed under • union • complement • concatenation • Kleene- and positive