Log In
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
0 votes
Check if max(L) is closed or not for max(L) : { w| w is in L but no x other than EmptyString, wx is in L }.

Correct if Logic is wrong.,

If wx is not in L ( except x is empty ) i.e. x forces the flow to stop at a non-Final state. So unless x is Empty, constructing a dfa for wx is not possible and by definition if x is Empty wx lands on a final state, so is w alone.

A dfa is possible for all ‘w’ in L => dfa is possible for  ‘w’ for max(L) => Closed.
in Theory of Computation 13 points 6 views

Please log in or register to answer this question.