CS-6205 - Automata Theory and Formal Language oed answer key

Showing 181 to 200 of 246 total answers.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Which of the following statements are for a concept called inherent ambiguity in CFL?

Answer

Every CFG for L is ambiguous

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

What is the final result after converting the following NFA-ε to NFA without Null move.

Answer

What is the final result after converting the following NFA-ε to NFA without Null move.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

In Allan M. Turing proposed the Turing machine as a model of "any possible computation".

Answer

1936

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

The language L contains all strings over the alphabet {a,b} that begin with and end with

Answer

a,b

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

* Starts from tree leaves. It proceeds upward to the root which is the starting symbol S.

Answer

Bottom-Up Approach

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Global Positioning System (GPS) calculates latitude and longitude from satellite signals.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

The minimum number of states required to recognize an octal number divisible by 3 are/is.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A PDA accepts a string when, after reading the entire string, the PDA is in a final state.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

An automaton that produces outputs based on current input and/or previous state is called.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Any production rule in the form A → B where A, B ∈ Non-terminal is called unit production.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

It starts from the bottom with the string and comes to the start symbol using a parse tree.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Which among the following is the correct option for the given grammar? G->X111|G1,X->X0|00.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

The relationship between recursive and recursively enumerable languages is ________________.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Which of the following statements are correct for a concept called inherent ambiguity in CFL?

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

The PDA has infinite memory and access in _____ order and the finite automata has ____ memory.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A language accepted by Deterministic Push down automata is closed under which of the following?

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A formal language is a set of strings, each string composed of symbols from a finite set called.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A grammar G is ambiguous if there is a word w Î L(G) having are least two different parse trees.

#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A parsing that starts from the top with the start-symbol and derives a string using a parsetree.

Page 10 of 13