Register

AAI Mock 4 - TOC

418 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · MadeEasy Full Lengt...Next → · Noob Doubt
← Previous in category · turing machineNext in category → · Noob Doubt
Position:
Show:

Related questions

1 1 vote
0 0 answers
549
549 views
aftab0711 asked Aug 13, 2024
549 views
Question on TOC
Select the correct statements (1) L1 = L2 if and only if L1* = L2* (2) For any languages L1, L2 and L3, L1 (L2 ∩ L3) ⊆ (L1L2) ∩ (L1L3)(3) For any languages L1, L2 and L3,...
1 1 vote
2 2 answers
636
636 views
aftab0711 asked Aug 11, 2024
636 views
Interesting question on Regular Language (TOC)
Which of the following languages is/are regular?
2 2 votes
2 2 answers
3.7k
3.7k views
admin asked Apr 3, 2019
3,729 views
Ullman (TOC) Edition 3 Exercise 3.1 Question 2 (Page No. 91)
Write regular expressions for the following languages$:$The set of all strings of $0's$ and $1's$ such that every pair of adjacent $0's$ appears before any pair of adjace...
0 0 votes
0 0 answers
1.1k
1.1k views
admin asked Apr 3, 2019
1,117 views
Ullman (TOC) Edition 3 Exercise 3.1 Question 1 (Page No. 91)
Write regular expressions for the following languages$:$The set of strings over alphabet $\{a,b,c\}$ containing at least one $a$ and at-least one $b.$The set of strings o...