- is there an output string with the lowest weight? If so what is it, and what is it weight? -is there an output string with the highest weight? If so, what is it, what is it’s highest weight? -is there an output string with five symbols? If so what is it? If not what is the shortest string with at least five symbols? -it’s a string in that input language starts with “objeda” well the corresponding output string have few were symbols more symbols or the same number of symbols in the input strings?

Q: This question concerns strings over the alphabet { a, b, c, d, e }. (a) How many strings have length…

A: Length is 9 and exactly 4 a's We will fill 4 places with 4 a's in 9C4 ways The remaining 5 places…

Q: We have gone through multiple algorithms that find occurrences of one pattern in a text however you…

A: Algorithm Algorithm is a process or a set of rules to be followed in calculations or other problem…

Q: bool main(string x) { if ((x length() % 2) = 0) return (yes); else if (x.length0 == else return(no)L…

A: Y(P) is the set of inputs P accepts. N(P) is the set of inputs P rejects C(P) is the set of inputs P…

Q: Given a string S, determine whether it can be split into two non-empty palindrome strings. If  yes,…

A: Since you have not asked for the language in which you want the code that means any language will…

Q: List 3 strings of different lengths that D accepts and also 3 that it rejects. What is the shortest…

A: A string is said to be accepted if the automata reaches final state by the given string and if it…

Q: what is it’s input alphabet? -what is it’s output alphabet? - if the input alphabet above its set…

A: Answers a. AY, K, S, R, IY, M, epsilon b. eye, I, ice, cream, scream. c. Yes because the input is…

Q: What is the FA corresponding to the language of strings, over alphabet {a, b}, that start with a and…

A: A finite automata has a finite number of states and each state has accepted or rejected strings. A…

Q: Consider the two strings A = "comp", B = "prog". With the given string functions, write the string…

A: given: a = comp b= prog show output

Q: got an error message for the answer Bartleby gave me last night as follows   Input Answer…

A: PROGRAM CODE: alphabet = "abcdefghijklmnopqrstuvwxyz"test_dups =…

Q: (B) Strings of a’s, whose length is a prime number. (C) Set of all palindromes made up of a’s and…

A: Given Which of the following are not regular?

Q: Show that the following languages are not regular: ( www | w is any string over E } with E = { a, b…

A: Given:

Q: Show that the following languages are not regular: { www | w is any string over E} with E= { a, b }…

A: The language is given as, Pumping lemma for regular languages: Assume given language is regular…

Q: L3 is the set of strings over the alphabet E = {a,b.c.d.e.z} such that the first letter is not a.…

A: Given: alphabet ∑=a,b,c,d,e,.....zw=alishbaw R =? first letter is not a.

Q: given a string s comprising of the characters 0, 1, and ?.    We should call a string unsteady in…

A: Here have to determine about string unsteady in the event problem statement in python.

Q: a. Draw a DFA for the language accepting strings ending with ‘bbabb’ over input alphabets ∑ = {a,…

A: DFA It refers to deterministic finite automata. Deterministic refers to the distinctiveness of the…

Q: Build a PM that takes in any string of a's and b's and leaves in its STORE the complement string…

A: Answer: I have given answered in the handwritten format in brief explanation

Q: A hexadecimal string is a finite sequence of the numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D,…

A: Given that: A hexadecimal string is a finite sequence of the numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,…

Q: A hexadecimal string is a finite sequence of the numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D,…

A: Given that, A hexadecimal string is a finite sequence of the numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,…

Q: A hexadecimal string is a finite sequence of the numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D,…

A: in below we  take the value of the numbers in hexadecimal and binary.

Q: Given a sentence A, count the number of palindrome words in a long string. Where A is given below:…

A: Actually, string is a sequence of characters.

Q: All strings x ∈ {0, 1}* such that x contains 0^9 as a substring, or |x| is divisible by 8, or #0(x)…

A:

Q: A hexadecimal string is a finite sequence of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E,…

A: The answer is

Q: In a string, we can have repeated pattern. Example: Input Output abc none abaa none aaaa (a) 4 abab…

A: required: create a program to find the pattern in a string.   All the code and screenshots are…

Q: 7. For each RE, give two strings that are in the corresponding language and two strings that are…

A: We are given 3 regular expression and we will give two example string which correspond to given…

Q: Which language over the alphabet {a,b} is recognised by a Finite Automaton with two states, no…

A: The answer should be option e, because start state will be the final state in finite automata of…

Q: In a string, we can have repeated pattern. Example: Input abc Output none abaa none (a) 4 (ab) 2…

A: Here we need to print the pattern and their repeating count, consider statement 3 i.e. aaaa here we…

Q: Suppose that x and y are strings equivalent to x.replace(y, x[x.find(y):]+x[x.fi

A: Suppose that x and y are strings. Which of one the following expressions would be equivalent to x .…

Q: string a will be a substring of a string b if a can be obtained from b by erasure of several…

A: Here have to determine about the String Generation programming problem statement.

Q: Write java program to read string and testing first latter if upper latter to change small latter…

A: import java.util.*; class Upper {  public static void main(String[] args) {     Scanner scanner =…

Q: Take input a string in which words are seperated by comma ,  Print all the words seperately.…

A: Since Programming language is not mentioned so I have used C++ programming language.  To Read a…

Q: Which language over the alphabet {a,b} is recognised by a Finite Automaton with two states, no…

A: Finite automata with two states  No loops One final state which is same as start state is as below:

Q: build a DFA that accepts the described language. The set of strings over {a, b, c} in which every b…

A: Deterministic finite automata of the given language

Q: Example 4: Consider the NFA shown in below figure. Check the acceptability offollowing string scanf…

A: The Answer is in Below Steps

Q: Now, to work with some FSAs over the alphabet Σ = {a, b}. Give a regular expression and draw an FSA…

A: Note: since your question contain multiple question but we can answer only one question at a time…

Q: /** * Look for patterns like "zip" and "zap" * in the string -- length-3, starting with * 'z' and…

A: public static String zipZap(String s) {  String res = "";  int i;    for(i = 0; i < s.length() -…

Q: Suppose that D1 and D2 are two DFAs. Give an algorithm for finding a string the D1 accepts, but D2…

A: Suppose that D1 and D2 are two DFAs. Give an algorithm for finding a string the D1 accepts, but D2…

Q: Consider the two strings A = "computer", B = "intro". With the given string functions, write the…

A: given: A = computer B = intro   task: give the output.

Q: en a string S, decide whether it can be part into two non-empty palindrome strings. On the off…

A: To check String S,  part into two non-empty palindrome strings, for that I have given C code below.

Q: List all strings in L whose length is less than 5, where L is defined by the regular expression (a +…

A: Given regular expression(a + b)* ba (a + ab)* This regular expression represents all the strings…

Q: Consider the language £* where E = {o, ob, ba} a) Is the string abbba a word in this language? bl…

A: The regular expression will be (a+ab+ba) * A)  String abbba Here we cannot generate three continuous…

Q: = { 0.1} (i) Give a DFA, M1, that accepts a Language L1 = {all strings that contain 00} (ii) Give a…

A: lll)   Acceptor for reverse of L1         Step 1 :- Inter change the intial and final states…

Q: For any string w = wi w2 .. Wn, the reverse of w, written w", is the string w in reverse order, w,…

A: A is regular There is a DFA with I, initial state, {F1, F2, ..} Final states Let's Modify the DFA…

Q: Write a C++ program that reads ten single words (c-strings) from the user. All the words are in…

A: Coded using C++.

Q: What set of strings is generated by the following grammar? S bS I Sa I aSb I ∈ Give proof.

A: Given: grammar is S bS I Sa I aSb I ∈

Q: Provide R.E of a language where every string starts and ends with dissimilar letters over {8 , 9}

A: Regular expression for language: In case regular expression are equal if and only if than correspond…

Q: Ʃ = {a, b} Give the regular expression for all strings in which any b’s that occur are in groups of…

A: Automata theory is the process of studying the abstract of machines and computational problems. The…

Q: Write a program in F95 language to declare any random string with any length and print it.

A: Syntax to declare string: CHARACTER(len = string length):: String_Name  Then given value to the…

Q: Example 4: Consider the NFA shown in below figure. Check the acceptability of following string scanf…

A: Given

Q: . The input to this problem is a pair of strings A = a1   am and B = b1   bn. The goal is to…

A: Given :Two input strings A = a1   am and B = b1   bn. The goal is 1to convert A into B as cheaply as…

Q: The input to this problem is a pair of strings A = a1   am and B = b1   bn. The goal is to convert…

A: Given: Two strings A = a1   am and B = b1   bn is given. The goal is to convert A into B as cheaply…