formal languages and automata theory
Authored by Balan KNS
Computers
University
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
5 questions
Show all answers
1.
MULTIPLE SELECT QUESTION
45 sec • 1 pt
Which of the following is Context free Grammar
AB-->C
X-->AB
Xa-->AB
X-->ABC
2.
MULTIPLE SELECT QUESTION
45 sec • 1 pt
which of the following is in Greibach normal form
A-->a
A-->ab
A-->aB
A-->Ca
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
regular languages are accepted by
finite automata
Turing machine
Pushdown Automata
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Pushdown Automata accepts
recursive language
context free langauge
regular language
context sensitive language
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
unrestricted grammar is also known as
Type 0 grammar
Type 1 Grammar
Type 2 Grammar
Type 3 Grammar
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
