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

Binary constraints, Binary Constraints: Alternatively unary constraint...

Binary Constraints: Alternatively unary constraints specify that a particular variable can take certain values that basically restricts the domain for that variable thus shoul

What are intelligent agents, Q. What are intelligent agents? What tasks wil...

Q. What are intelligent agents? What tasks will they perform? ANSWER: Intelligent agents are software that helps you, or operate on your behalf, in performing repetitive comput

What is metropolitan area network, Q. What is Metropolitan Area Network? ...

Q. What is Metropolitan Area Network? Metropolitan Area Network (MAN):  It is privately or public owned communication system that naturally covers a complete city. Speed is abo

De multiplexer, design a gray to bcd code converter using 16:1 de multiplex...

design a gray to bcd code converter using 16:1 de multiplexe

Failures, FAILURES Since reliability engineering is focused on the surv...

FAILURES Since reliability engineering is focused on the survivability or absence of failures, it is more concerned about failures,  understanding  their causes and defining re

Html, discuss hypertext mark up language

discuss hypertext mark up language

Information technology infrastructure, The IT infrastructure of MobTex is s...

The IT infrastructure of MobTex is simple but vital to the operation of the business. All client data, billing, stock management etc is done via a specialised application called "A

Determine the example - fork-join, Determine the Example - "fork-join" ...

Determine the Example - "fork-join" module initial_fork_join(); reg clk,reset,enable,data; initial begin $monitor("‰g clk=‰b reset=‰b enable=‰b data=‰b", $time, cl

Explain difference between dynamic and static binding, Explain difference b...

Explain difference between Dynamic and static binding. Dynamic and static binding: Dynamic binding is a binding performed after the execution of a program has immediately beg

What is a compiler, What is a compiler? A Compiler is a program that ac...

What is a compiler? A Compiler is a program that accepts a program written in a high level language and creates an object program.

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