Provide non-deterministic finite automata accepting the following languages over the alphabet Σ = {a,b}. Note: For w ∈ Σ∗,σ ∈ Σ, we use nσ(w) to mean the number of letters σ in w. 1. L1 = {w ∈ Σ∗ : w contains the substring ababa} 2. L2 = {w ∈ Σ∗ : na(w) mod 2 = 1 or nb(w) mod 3 = 2} 3. L3 = {w ∈ Σ∗ : w starts and ends with the same letter} A proof of correctness is not required, but you must use non-determinism.

Q: What is the cardinality of the set of 2 x 2 matrices over N? Prove your answer.  Note: a 2 x 2…

A:

Q: hi: Z12 → 26, i = 1,2 is the homomorphism of the circuits a 2xmod (6) = a) h1 (x) b) h2 (x) = xmod…

A: Given- Two circuits  (Z6 , +, ·) , (Z12 , +, ·)  hi: Z12→Z6 i=1,2 is the homomorphism of the…

Q: Consider the affine cipher with encryption function c(x) = 3x – 1 mod 26. a) What is the decryption…

A: Properties of modular function : Here a,b∈ℤ and n∈ℕ . ax≡b mod n is equivalent to b≡ax mod n.…

Q: 2. Let A1 and A2 be two σ‐algebras of subsets of Ω. Prove that their intersection A1 \ A2 is also a…

A: 2. Intersection of two sigma algebra is sigma algebra.

Q: Consider the linear congruence ax = b (mod m). If (a,m) = 1, then this has a unique solution x = a¹b…

A: Since gcd(a,m)=1. ad+mk=1 for some integers d and k. ⇒ad=1-mk⇒ad=1 (mod m) So a is invertible (mod…

Q: Quéstion 2 Let L be the language L={ a3 mch | (3n+n)>m} over the alphabet E-{a,b,c}. Prove that L is…

A: This question is about application pumping lema

Q: Consider the following language over the alphabet Σ = {a, b} L = {w : nb(w) is even, na(w) is odd,…

A: To design the minimal deterministic finite automaton (DFA) for the language L over the alphabet…

Q: If {u, v} is an orthonormal set in V, then ||uv|| = √√√2.

A:

Q: A The legih in pnefers of the fout sider f a building angx Cox- 5-9*, and Axt a. Calculate The…

A: Solution :   (a)   Total length around the building               = 3x + (6x - 5) + 9x + (4x + 1)…

Q: 1. Prove that if ā and be Zn are invertible modulo n, so is ā - b. Is this the case for ā + b?…

A:

Q: Construct an affine cipher that uses only uppercase letters of English alphabet encoded as elements…

A:

Q: Determine, if possible, the affine cipher C = aP + b (mod 26) that sends plaintext "BI" to…

A: Introduction:  to determine the affine cipher, we need to use the values corresponding to the…

Q: Let p be a primes. if the linear system X a (mod p) x = b (mod qp) is solvable then a-b =0 (mod p)…

A: The given statement is TRUE.

Q: The linear congruence ax = b(mod m) has a unique solutionif and only if: gcd (a,m) =1 gcd(a,m) =1 o…

A: First option is correct. gcd(a, m)=1.

Q: Consider the following recursively defined set S Basis elements: {2, 4, 8} • Recursive step 1: x, y…

A: Let Px: ∃k∈ℕ, such that x=2k. We must prove that for all x∈S, Px is True.

Q: 1.1 Define on R the operation * by + b = a + b – ab , where +,-, · has the usual meaning in R. Prove…

A: Define on R the operation * by a * b = a + b – ab, where +,-, · has the usual meaning in R. Then we…

Q: Prove that if gcd(a, m)=1 and gcd(a - 1, m) =1, then 1+a+a²+...+ a² + a(m)−1 = 0 (mod m).

A:

Q: 5. Find the sum of products expansions of these Boolean functions. F(w, x, y, z) that has the value…

A:

Q: Q2a) For all integers a,b,c, prove or disprove each of the following: i) If a | c and b | c, then ab…

A:

Q: 11. (10 pts) Given a relation R from a set X = {1,..., m} to a set Y = (1,...,n}, we represent R as…

A: The objective of the question is to write an algorithm that determines if a given relation R,…

Q: Consider the set Z, × Z, = {(x, y) : x € Z, and y € Z3}. Define the operation/sum O in Z2 × Z3 such…

A:

Q: 2.2.7 Exercise Let X be a nonempty set and S the smallest o-algebra in X which contains all…

A:

Q: d. y= x² + y x + cos y

A:

Q: Let C be a binary linear code of length n, n odd, and let C be the extended binary linear code…

A:

Q: 2. How many bit strings(strings of 1 or 0) of length 8 are there such that it contains no more nan 3…

A:

Q: 3. Let Y= {1, 2, 3} be a finite set, and X its power set. Define a feature map embedding it into…

A: Given: In this problem, the given details are Here, let's consider the set Y=1,2,3 be a finite set…

Q: statements are equivalent :

A:

Q: 13. If T is self-adjoint, then S*TS is self adjoint for all S; if S is invertible and S*TS is…

A:

Q: 1. Assume that = 1.a1a2...a12 is the significand in the binary representation of a number r.…

A: Given: x¯=1.a1a2....a12   Binary representation: In the binary representation of a number, each…

Q: 3. Given BF is F(x,y,z) = x ỹ z +ã y z + š ỹ ž+xỹž. Simplify the BF by k-map (i) (ii) Draw a…

A:

Q: O Finite fields Use Gaussian elimination, by hand, to seve the following system of equations, mod 2…

A: Solve the following

Q: consider the following arrays defined in Matlab's workspace z=[2 9 0 ; 7 5 6] Retrieve or create…

A: Given,

Q: (a) Let * be defined on Z by a * b = 2ab. Determine whether the binary operator defined is…

A:

Q: |K| key space size for affine cipher over Z135

A: Consider for example For affine cipher e(x) = ax+b (mod m)1<= a,b <=26gcd(a , b) = 1For any…

Q: Given the following recursively defined set S: Basis: 0 € S and 7 E S Recursive rule: if x = S and y…

A:

Q: 1) Give a recursive definition for the language STRANGE which is defined over the alphabet Σ = {a,…

A: 1) Recursive Definition for STRANGE:Base case: The empty string "" and the strings "b" and "a"…

Q: Show that, if X is a Hilbert space and A is a countable complete orthonormal set, then X is…

A:

Q: Suppose a community of RSA users share the same encryption exponent e but each user i has their own…

A: Show that if k>e, then a cryptanalyst can recover the plaintext x without factoring any of the…

Bare bones programming language

Bare bones programming language is a low-level programming language that gives a detailed stepwise description of a program. It has a tight program design and in-depth understanding of the toolchain. It is based on the target environment and is used for safe coding practices. C programming language is a type of bare bones programming language.