(A) Stack
(B) Pop and Stack
(C) Pushdown Stack
(D) None of these
Category: Theory of Automata Mcqs
Theory of Automata Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Theory of Automata Mcqs portion from here.
The word ‘formal’ in formal languages means?
(A) They are unnecessary, in reality
(B) Only the form of the string of symbols is significant
(C) The symbols used have well defined meaning
(D) None of these
Grammatical rules which do not involve the meaning of words are called __.
(A) Semantics
(B) Syntactic
(C) Both a and b
(D) None of given
Choose the correct statement?
(A) A Mealy machine generates no language as such
(B) A Moore machine generates no language as such
(C) A Mealy machine has no terminal state
(D) All of these
Grammatical rules which involve the meaning of words are called __.
(A) Semantics
(B) Syntactic
(C) Both a and b
(D) None of given
The high level language is converted into assembly language codes by a program called compiler?
(A) True
(B) False
(C) NA
(D) NA
To examine whether a certain FA accepts any words, it is required to seek the paths from __ state.
(A) Final to initial
(B) Final to final
(C) Initial to final
(D) Initial
The deviation of the word W generated by a CFG, such that at each step ,a production is applied to the left most nonterminal in the working string is said to be?
(A) Left most terminal
(B) Left most deviation
(C) None of these
(D) A ,B both