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

Sequential logic gates - sr flip flop, Sequential Logic Gates SR flip ...

Sequential Logic Gates SR flip flop                                                                                                                    1)

Arithmetic-logic section in computer system, Arithmetic-logic section in co...

Arithmetic-logic section in computer system: The   arithmetic-logic section performs arithmetic   operations, such subtraction, addition, multiplication, and division. Throug

Which is valid syntax of the fork and join primitive, Which is valid syntax...

Which is valid syntax of the Fork and Join Primitive? Ans. A valid syntax of the Fork and Join Primitive is as given below: Fork Join

Explain asymmetric cryptographyand its components, Explain Asymmetric crypt...

Explain Asymmetric cryptographyand its components. Asymmetric or public-key cryptography be different from conventional cryptography in which key material is bound to a single

Explain user datagram protocol, Explain User Datagram Protocol. UDP(Use...

Explain User Datagram Protocol. UDP(User Datagram Protocol) : User Datagram Protocol uses a connectionless communication paradigm. It is an application using UDP does not re

What is null pointer, What is NULL POINTER Inside main, a FILE * called...

What is NULL POINTER Inside main, a FILE * called file. Afterwards, the fopen function, passing it the path to data file, as well as "r", only intending to read from the file.

No-signs to the write statement, Suppressing the number signs (+/-) is carr...

Suppressing the number signs (+/-) is carried out using the addition NO-SIGNS to the Write statement.  Statement is wrong.

Define bidirectional bus, Define bidirectional bus? A bidirectional bus...

Define bidirectional bus? A bidirectional bus is that which permits the transfer of data either from memory to CPU during a read operation or from CPU to memory during write op

Multiple stack, how to implement the multiple stack

how to implement the multiple stack

Define master construct in fortan, Q. Define Master Construct in FORTAN? ...

Q. Define Master Construct in FORTAN? The master directive has following general form:  #pragma omp master structured_block  It causes master thread to execute structu

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