FREE PRACTICE
Language:
English
हिन्दी
English + हिन्दी
Question 1 of 10
0% complete
Theory of Computation and Compilers
Theory of Computation and Compilers
An automaton over an empty alphabet can accept
A
all binary strings
B
possibly epsilon depending on its start state
C
only strings of length one
D
no possible language
Check Answer
Free trial • 10 questions • No account required
✦
QuestAce Help
✦
QuestAce Assistant
Self-service help · Always available
↻
×
👋
Welcome to QuestAce!
Your quick guide to MCQ practice, mock tests and your learning account.
What would you like help with?
Automated guidance only. No teacher or immediate callback is promised.
FREE PRACTICEFREE PRACTICE