Computer science formal language

  • Thread starter francisg3
  • Start date
  • #1
32
0
Suppose L[tex]\sum[/tex]* = L for an alphabet [tex]\sum[/tex] . What can we say about the possible strings in L?




I know that the [tex]\sum[/tex]* is a collection of all possible words of a language and I know that 'L' is a subset of [tex]\sum[/tex]* . So L concatenated with [tex]\sum[/tex]* needs to be equivalent to L. I am stumped.
 

Answers and Replies

  • #2
I like Serena
Homework Helper
6,577
176
Suppose L[tex]\sum[/tex]* = L for an alphabet [tex]\sum[/tex] . What can we say about the possible strings in L?

I know that the [tex]\sum[/tex]* is a collection of all possible words of a language and I know that 'L' is a subset of [tex]\sum[/tex]* . So L concatenated with [tex]\sum[/tex]* needs to be equivalent to L. I am stumped.
How about:

If w is a word in L, than w followed by zero or more symbols from ∑ is also a word in L?
 

Related Threads on Computer science formal language

Replies
12
Views
4K
Replies
5
Views
703
Replies
2
Views
2K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
4
Views
6K
  • Last Post
Replies
0
Views
2K
  • Last Post
Replies
5
Views
1K
  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
0
Views
1K
  • Last Post
Replies
1
Views
2K
Top