If we use internal data forwarding to speed up the performan...

MCQ

If we use internal data forwarding to speed up the performance of a CPU (R1, R2 and R3 are registers and M[100] is a memory reference), then the sequence of operations

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following statement is false?

Let L is a language accepted by a PDA P then there exist a CFG G L such that L(G) =N(P)

If L is a CFL then there exists a push down automata P accepting CFL L by empty stack i.e. L = N(P)

If L is a language accepted by PDA A by final state there exist a PDA B that accepts L by empty stack such that L =L(A) = N(B)

All of these

Discussion

MCQ

Which of the following languages are context-free?

L1 = {ambnanbm ? m, n ? 1}
L2 = {ambnambn ? m, n ? 1}
L3 = {ambn ? m = 2n + 1}

L1 and L2 only

L1 and L3 only

L2 and L3 only

L3 only

Discussion

MCQ

|-* is the __________ closure of |-

symmetric and reflexive

transitive and reflexive

symmetric and transitive

none of the mentioned

Discussion

MCQ

Regarding the power of recognition of languages, which of the following statement is false?

The non-deterministic finite state automata are equivalent to deterministic finite state automata

Non-deterministic pushdown automata is equivalent to deterministic pushdown automata.

Non-deterministic Turing machines are equivalent to deterministic Turing machines.

Multi-tape Turing machines are equivalent to Single-tape Turing machines.

Discussion

MCQ

In a pushdown automaton P=(Q,?,?,?,q0,F), a transition of the form,

where p,q?Q, a???{?}, X,Y,???{?}, represents

(q,Y) ? ?(p,a,X)

Consider the following pushdown automaton over the input alphabet ?={a,b} and stack alphabet ?={#,A}.

The number of strings of length 100 accepted by the above pushdown automaton is ___________ .

100

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics