Question 1 : A Push Down Automata is if there is at most one transition applicable to each configuration?
1. Deterministic
2. Non deterministic
3. Finite
4. Non finite
View Answer   Discuss with Members

Question 2 : A language is regular if and only if it is accepted by finite automata
1. The given statement statement is true
2. Given statement is false
3. Statement is partially true
4. None of the mentioned
View Answer   Discuss with Members

Question 3 : Grammars that can be translated to DFAs :
1. Left linear grammar
2. Right linear grammar
3. Generic grammar
4. All of the mentioned
View Answer   Discuss with Members

Question 4 : Which of the following identity is wrong?
1. R + R = R
2. (R*)* = R*
3. ?R = R? = R
4. ØR = RØ = RR*
View Answer   Discuss with Members

Question 5 : Which of the following statement is true?
1. Every language that is defined by regular expression can also be defined by finite automata
2. Every language defined by finite automata can also be defined by regular expression
3. We can convert regular expressions into finite automata
4. All of the mentioned
View Answer   Discuss with Members

Question 6 : Transition of finite automata is
1. Finite Diagram
2. State Diagram
3. Node Diagram
4. E-R Diagram
View Answer   Discuss with Members

Question 7 : The idea of an automation with a stack as auxiliary storage
1. Finite automata
2. Push Down Automata
3. Deterministic Automata
4. None of the mentioned
View Answer   Discuss with Members

Question 8 : CFG is
1. Compiler
2. A language expression
3. Regular Expression
4. None of the mentioned
View Answer   Discuss with Members

Question 9 : Can Left Linear grammar be converted to Right Linear grammar
1. Yes
2. No
3.
4.
View Answer   Discuss with Members

Question 10 : A Regular Grammar is any right-linear or left-linear grammar.
1. True
2. False
3.
4.
View Answer   Discuss with Members