Beruflich Dokumente
Kultur Dokumente
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Maths
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Technical
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
no of states (0+1)*(0+1)(0+1)*
L1 = a^m b^n c^(m+n), L2 = a^n b^n c^2n, regular or not
toc l1 regular l2 context free l3 recusrive.. option I and II and III
TM encoding given, problems decidable or not
Question on closure properties, L1, L2, L3 and L4
NFA in which all states are final states accepts universal language