First time here? Checkout the FAQ!
+1 vote

Please ANSWER these?

asked in Theory of Computation by Loyal (4.6k points) 4 39 112 | 85 views
1: Regular

2: Regular


@ Ankit Srivastava 7   How 3rd one is DCFL and not CFL?

If it is DCFL then obviously it is CFL

I am not saying it is not CFL

DCFL is subset of CFL

if you want most accurate answer then it will be DCFL

see L1={a^n b^m | n=m} is complement of given language

and this language is DCFL and DCFL's are closed under this language is also DCFL

Ankit Srivastava 7  Thanks bro!

1 Answer

+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 

answered by Veteran (13.3k points) 16 55 115
selected by

@sourav Whoa! Thanks, that was quick! Keep up, mate. Thanks again.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23338 Points

  2. Bikram

    17048 Points

  3. Habibkhan

    7912 Points

  4. srestha

    6238 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4968 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4286 Points

  9. sushmita

    3964 Points

  10. Rishi yadav

    3794 Points

Recent Badges

Popular Question user1234
Copy Editor Ayush Upadhyaya
Popular Question asu
Popular Question .
Popular Question makhdoom ghaya
Popular Question junaid ahmad
Notable Question learner_geek
Notable Question jothee
Popular Question jothee
Notable Question Jeffrey Jose
27,290 questions
35,142 answers
33,231 users