565 views

1 Answer

2 2 votes

PS: ignore my handwriting and image lighting.

 

 

Position:
Show:

Related questions

3 3 votes
2 2 answers
3.5k
3.5k views
Tuhin Dutta asked Nov 22, 2017
3,523 views
...............................................................
0 0 votes
1 1 answer
881
881 views
rohankrishan asked Jun 30, 2022
881 views
Examples that work: 100, 0000000101,110101010101 This DFA requires at least 8 states
13 13 votes
2 answers 2 answers
5.1k
5.1k views
tushark asked Nov 5, 2014
5,055 views
L1 = { a^i b^j c^m | m ≥ min(i,j) }L2 = { a^i b^j c^m | m ≥ max(i,j) }Which language is CFL ?ANS : L1 is CFL but L2 is NOT.My understanding : For Language L1 :( Here I am...
0 0 votes
1 1 answer
774
774 views
saket jaiswal asked Jan 7, 2025
774 views
#include <stdio.h void swap(int x, int i, int j) { int *temp; temp = x[i]; x[i] = x[j]; x[j] = temp; } int main() { int a[6] = {1, 2, 3}; int (*p)[6] = &a; int *arr[3] ...