1,277 views
0 votes
0 votes

Please log in or register to answer this question.

Related questions

4 votes
4 votes
1 answer
1
Garrett McClure asked Oct 9, 2017
1,253 views
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }.How do I show that the family of regular languag...
2 votes
2 votes
1 answer
4
Garrett McClure asked Oct 3, 2017
515 views
Let L be any regular language on Σ = {a, b}. Show that an algorithm exists for determining if L contains any strings of even length.