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

Describe the assume - assembler directives, Describe the Assume - Assembler...

Describe the Assume - Assembler directives ASSUME: This directive would be used to map the segment register names with memory addresses.  Syntax is as below: ASSUME SS:

What is the difference among conventional and HD T.V, a. Write down the sal...

a. Write down the salient difference among conventional T.V. and High Definition TV (HDTV) and also highlight the various benefits of digital representation for video. b. Video

Xternal report the parameters or select-options, Normal 0 false...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Communication between memory and the processor, How are instructions sent b...

How are instructions sent between memory and the processor? Both the instruction pointer (IP) and program counter (PC) utilized to holds the memory address of the next inst

Weighted-average under perpetual inventory procedure, Q. Weighted-average u...

Q. Weighted-average under perpetual inventory procedure? Weighted-average under perpetual inventory procedure in perpetual inventory procedure firms calculate a new weighted-av

Explain about the voice recognition device, Explain about the Voice recogni...

Explain about the Voice recognition device Blind and partially-sighted people can communicate with a computer using microphone and software (keyboard and touch screens can't be

Define buffering, Define buffering.  A buffer is a memory area that kee...

Define buffering.  A buffer is a memory area that keeps data while they are transferred among two devices or among a device and an application. Buffering is done for three reas

Example of prolog, Example of Prolog: We can say that this is also tru...

Example of Prolog: We can say that this is also true if there are four even numbers. Now we have our first rule: • If there are three or four even numbered cards, such play

Area under curve , Write a program to find the area under the curve y = f(x...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Explain the term- looking at existing paperwork, Explain the term- Looking ...

Explain the term- Looking at existing paperwork This allows analyst to see how paper files are kept and look at operating instructions and check accounts, training manuals etc

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