The language accepted by finite automata is
Which of the following statements is correct ?
Which of the following words are accepted by the PDA P ?
which of following applications regular expressions can no tbe used.
Can a DFSA simulate a NFSA
The concept of FSA is much used in this part of the compiler
The concept of grammar is much used in this part of the compiler
A language L is accepted by a FSA iff it is
Consider the following statements
I: Recursive languages are closed under complementation
II:Recursively enumerable languages are closed under union
III:Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE ?
The following grammar
G = (N, T, P, S)
N = {S, A, B}
T = {a, b, c}
P : S --> aSa
S --> aAa
A --> bB
B --> bB
B -->c is