Register

Recent questions tagged deterministic-finite-automata

0 0 votes
1 1 answer
36
36 views
GO Classes DPP | GATE CS | Theory of Computation | DFA as DPDA
Let $L$ be a regular language accepted by a DFA $D=(Q,\Sigma,\delta,q_0,F)$. Which construction correctly proves that $L$ is a deterministic context-free language?Make a ...
User Avatar
0 0 votes
1 answers 1 answer
746
746 views
Test by Bikram | Theory of Computation | Test 1 | Question: 12
Let $N(f) =$ the class of languages accepted by Non- deterministic Finite Automata,$N(p) =$ the class of languages accepted by Non- deterministic Push down Automata,$D(f...
User Avatar
To see more, click for the full list of questions or popular tags.