Consider the languages Σ = {a, b} and Γ = { Ø, λ, ∪, (, ), a, b }. Let L ⊆ Σ such that for all x ∈ L, x is a regular expression for Σ.
Is the language Γ regular?
Name:
Anonymous2009-02-06 23:28
>>20
I admire your attempt to troll, but regular languages are defined in terms of finite state machines, and the input to these machines can be arbitrarily large.