1: Regular

2: Regular

3: DCFL

2: Regular

3: DCFL

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+1 vote

+2 votes

Best answer

A)$L_{1}=\left \{ a^{n}\,|\, n> 0 \right \} L_{2}=\left \{ b^{n}\,|\, n> 0 \right \}$

Regular language are **closed under** Concatenation.Hence **regular **

$L_{1}.L_{2}=\left \{ a^{x}b^{y}\,\,|\,\,x,y > 0 \right \}$

Regular expression-:$a^{+}b^{+}$

B)$L_{2}=\left \{ a^{n}b^{m}\,\,|\,\,n,m \geq 0 \right \}$

Regular Expression-:$a^{*}b^{*}$

Hence **regular**

C) Not regular need a stack to remember $n$,Thus can't be solved by FSM

Hence not **regular **

- All categories
- General Aptitude 1.2k
- Engineering Mathematics 4.8k
- Digital Logic 2k
- Programming & DS 3.5k
- Algorithms 3k
- Theory of Computation 3.8k
- Compiler Design 1.5k
- Databases 2.8k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 941
- Others 1.2k
- Admissions 336
- Exam Queries 410
- Tier 1 Placement Questions 17
- Job Queries 52
- Projects 8

34,241 questions

40,932 answers

116,232 comments

39,846 users