Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

We define the minimal words language of $L, \min(L)$, to be the language of all words in $L$ that don't have any prefix in $L$.

Assume $L$ is regular language. I need to prove by building an automaton that $\min(L)$ is regular.

share|improve this question
1  
Welcome at math.SE! You can use $\LaTeX$ here, e.g. $L$ would look like $L$, for more see FAQ, it is very helpful. Also, could you please fix the spelling of your post (e.g. use the browser build-in spellchecker)? Some people might find the quality of your question insulting. –  dtldarek Nov 30 '12 at 17:08
    
Look, for example, at the edits I just made. Click on the link after the word "edited" and then look at the source, by clicking on "source". –  Rick Decker Nov 30 '12 at 17:11

1 Answer 1

Hint: Consider a deterministic automaton, if you happen to be at the accepting state, anything that comes later should send you to the "trash" state.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.