Construct the finite automata, Computer Engineering

Assignment Help:

Give the regular expression of the set of all even strings over the alphabet {a, b} along with at least one of the two substrings aa or bb. As well construct the finite automata which can accept the above language.   

Ans: Let us very firstly draw the finite automata that accepts set of all even strings over alphabets 

80_construct the finite automata.png

{a, b}. The regular expression for class of strings accepted through the automata is

(aa + bb + abba + abab + baba + baab)*


Related Discussions:- Construct the finite automata

What is inheritance, What is Inheritance? Inheritance is the method of ...

What is Inheritance? Inheritance is the method of deriving a feature of super class into sub class. Every sub class inherits the attributes, operations and association of its s

What is busy hour traffic, Busy hour traffic is the (A)  maximum avera...

Busy hour traffic is the (A)  maximum average simultaneous traffic. (B)  traffic during peak hour. (C)  traffic when all subscribers are engaged. (D)  the durat

Perform the subtraction using 1's complement, Perform the subtraction using...

Perform the subtraction using 1's complement of 11001 - 10110 Ans. 11001 - 10110 = X - Y                            X = 11001 1's complement of Y = 01001

Differentiate between motion and shape tween, Question: 1. In Flash, w...

Question: 1. In Flash, what is the purpose of a motion guide layer? 2. Differentiate between Motion and Shape tween. 3. Give the steps to create a layer mask in flash.

C-programing, c-program for the minimum total number of shelves

c-program for the minimum total number of shelves

Create a social network application, A software development company wants t...

A software development company wants to create a social network application where users can post brief audio messages giving their thoughts. Each user of the application will ha

Define parsing, Define Parsing Parsing is the method of analyzing a te...

Define Parsing Parsing is the method of analyzing a text, made up of a sequence of tokens, to define its grammatical structure with respect to a given formal grammar. Parsing

Find the boolean expression for the logic circuit, Find the boolean express...

Find the boolean expression for the logic circuit shown below. Ans. Output of Gate-1 (NAND) = (AB)' Output of Gate-2 (NOR) = (A'+B)' Output of Gate-3 (NOR) = [(AB)' + (

Dram, DRAM consists of MOSFET's but the technique is to use the drain sourc...

DRAM consists of MOSFET's but the technique is to use the drain source capacitance to hold charge. If charge is present logic '1' is held, no charge logic '0'. As you know capacito

What is focussed ion beam fix, What is Focussed Ion Beam Fix? A FIB Fix...

What is Focussed Ion Beam Fix? A FIB Fix (Focussed Ion Beam) Fix is simply performed onto a terminated chip. FIB is a somewhat exotic process where a particle beam is capable t

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd