Design FAs for the following: a. Build an FA that accepts only those words that have even no. of "a" and even number of "b". b. Write regular expressions and build a finite automaton for language contains all the words having even number of a's? c. Write regular expressions and finite automata for language that starts with "aa", ends at "bb" and fourth character should be "b"

Design FAs for the following: a. Build an FA that accepts only those words that have even no. of "a" and even number of "b". b. Write regular expressions and build a finite automaton for language contains all the words having even number of a's? c. Write regular expressions and finite automata for language that starts with "aa", ends at "bb" and fourth character should be "b"

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a regular expression that describes the languages of automata from Homework No. 2 and Homework No. 3.Hint: It's the same language.
I need help to construct a dpda for the language {w in {a,b}^*| w has an unequal amount of a and b}
Can you please help me with this problem I am struggling and I don't know how to solve this problem, can you do something visual for me to understand it better or show calculations and can you explain it step by step very thoroughly. question that I need help with: 1.42 For languages A and B, let the shuffle of A and B be the language {w| w = a1b1 · · · akbk, where a1 · · · ak ∈ A and b1 · · · bk ∈ B, each ai, bi ∈ Σ ∗ }. Show that the class of regular languages is closed under shuffle.
1. For each of the following regular expressions find a language (i.e., a set of strings) over A = {a,b,c} that can be represented/described by that expression. a. ??∗ + ?∗?? b. ?∗????∗
Construct npda that accept the following languages on Σ = {a, b, c}: L = {anb3n : n ≥ 0}.
Let α = (a + b)∗ab(a + b)∗. Give a regular expression equivalent to ∼ α in the following cases.Simplify the expressions as much as possible (either using the rules from the lecture or othermeans).(a) Σ = {a,b}(b) Σ = {a,b,c}Automata and Computability
Construct automata for the following regular expressions: a(bb)*b* 2. a*aab*bb
Write the simplest C++ program that will demonstrate iteration vs recursion using the following guidelines - Please include pre/post and pseudocode for the 3 functions which are not 'main' in the solution. Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper…
(a) For each of the following regular expressions, draw a deterministic finite automaton that recognises the same language. (ii) (a+b)(a+b+0+1)*@(a+b)(a+b)*.(a+b)(a+b)*
Prolog. R emember the "take" function of Haskell? It can be defined in Haskell as: take :: Int -> [a] -> [a] take 0 _ = [] take _ [] = [] take n (x:xs) = x : take (n-1) xs Formulate the appropriate Prolog predicate "take(N,Xs,Ys)" which is true if (and only if) "Ys" is what results from taking "N" elements from "Xs". That is, "take(3,[1,2,3,4,5],[1,2,3])." would evaluate to "true", or "take(3,[1,2,3,4,5],Ys)." would give "Ys = [1,2,3]", while "take(3,[1,2],Ys)" would give "Ys = [1,2]"
Prove that the following language is not context free.
The following is a grammar for JH-Lisp 2.1, modified version of the language you encountered in homework 4, with slightly different syntax, and expanded set of functions. It uses underscores rather than spaces, square brackets rather than paren- theses, and words as function names instead of symbolic operators. S →[O E E] E →[O E E]|N N →0|1|2|3|4|5|6|7|8|9|NN O →add|sub|mul|div|mod|shl|shr Create a PDA that recognizes JH-Lisp 2.1.