- #1
Astr00
- 1
- 0
[Thread moved by mentor]
Hi there.
As the title says, I want to inductively define the language consisting of the strings {a, b, aa, bb, aaa, bbb} and so on. I have come up with the following:
If it is, could I also accomplish the same with just the empty string as my base set?
An example of that would be:
Edit: I should have read the rules before posting. Could a moderator move this to the homework forum?
Hi there.
As the title says, I want to inductively define the language consisting of the strings {a, b, aa, bb, aaa, bbb} and so on. I have come up with the following:
Is this a correct method of inductively definining such a language, and am I defining the language that I set out to do?Let S be the smallest set so that a, b ∈ S and if x, y ∈ S, then xa, yb ∈ S.
If it is, could I also accomplish the same with just the empty string as my base set?
An example of that would be:
In this case I think Λ would act as both the x and y, which would turn into Λa, Λb or just a, b in the next step. But is this a correct way of doing it?Let S be the smallest set so that Λ ∈ S and if x, y ∈ S, then xa, yb ∈ S.
Edit: I should have read the rules before posting. Could a moderator move this to the homework forum?
Last edited by a moderator: