Regular Language Comparison

  • Thread starter twoski
  • Start date
  • #1
181
2

Homework Statement



Let truncn(L) = {w: wv exists in L, |v| = n}

Show that trunc is regular if L is regular.

The Attempt at a Solution



By the definition of regular languages, L is regular if we can come up with a regular expression or a DFA for it.

This question confuses me because what if we have a regular language L where the only string it produces is "aaa", and we take trunc8(L)? The string v can't exist if the length of wv is 3, but in this case we technically can since there are no constraints on n.
 

Answers and Replies

  • #2
181
2
Anyone?

I think that the constraints of truncn(L) prohibit us from choosing n larger than |wv| so ignore that part of my initial post.

Can i use a DFA to prove trunc is regualr?
 

Related Threads on Regular Language Comparison

  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
0
Views
975
  • Last Post
Replies
1
Views
1K
Replies
1
Views
1K
Replies
1
Views
830
Replies
0
Views
875
Replies
0
Views
3K
  • Last Post
Replies
0
Views
4K
Replies
0
Views
1K
Top