Register

ace mock - toc

321 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · TLB and EMATNext → · ace mock- I
← Previous in category · turing machineNext in category → · PDautomata
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
351
351 views
Sudeep 1 asked Oct 16, 2025
351 views
ACE Workbook - TOC Q-12
Give the regular expression that derives all strings of a's and b's where each string contain even occurrences of substring aba) (abab)*b) (b + abab)*c) (b + aa*bb*aa*b)*...
1 1 vote
3 3 answers
1.2k
1.2k views
Pratik.patil asked Oct 30, 2023
1,205 views
ACE TOC Test
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$
0 0 votes
1 answers 1 answer
1.5k
1.5k views
h4kr asked Dec 4, 2022
1,453 views
ace academy ToC
I don’t get the explanation, How do you categorize grammer on the basis of production?
2 2 votes
1 1 answer
638
638 views
Souvik33 asked Nov 23, 2022
638 views
CFL | TOC | Ace Academy Test Series
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE