The Gateway to Computer Science Excellence
0 votes
26 views

Show that the regular languages are closed under the following operations$:$

  1. $ min(L)=\big\{\text{w|w is in L, but no proper prefix of w is in L}\big\}.$
  2. $ min(L)=\big\{\text{w|w is in L, and  for no x other than $\in$  is wx in L}\big\}.$
  3. $ init(L)=\big\{\text{w| for some x, wx is in L}\big\}.$
in Theory of Computation by Veteran (59.5k points)
edited by | 26 views

Please log in or register to answer this question.

Related questions

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
50,737 questions
57,405 answers
198,627 comments
105,465 users