Reference no: EM133965792

Task 1: Accepting Languages with Reterna

Let Σ = {A, B, C} be an alphabet. In the following, the (extended) Reterna programs should each take as input a string w ∈ Σ* (encoded as a number) and a number k ∈ N_o, and decide whether w ∈ L_k ⊆ Σ*:

1. L_k = A^kΣ*
= { w ∈ Σ* | the first k characters in w are A }

2. L_k = { w ∈ Σ* | the letter A occurs exactly k times in w }

3. L_k = (A^k | B^k | C^k)* = { w ∈ Σ* | w consists of segments in which the same letter appears k times consecutively } Your reliable and affordable assignment help starts today!

Example: "AAACCCBBBAAA" ∈ L₃

Task 2: Programming with Reterna

Write a program in (extended) Reterna that takes a number n ∈ N_o as input and checks whether there exist three numbers a, b, c ∈ N with a ≥ 2, b ≥ 2, and c ≥ 2 such that:

a · b · c = n If n is the product of three integers greater than or equal to 2, your program should return true; otherwise, it should return false.