Discrete math, Basic Computer Science

Assignment Help:
Below you will find a question the areas of automata. Solve the problem showing all steps. Thoroughly explain how and why you performed each step with complete sentences.

A finite-state automaton is given by the 5-tuple (Q, ?, d, q, F), where

Q = the finite set of states = {A, B, C}

? = the Alphabet (inputs) = {x, y}

d = the transition function using the alphabet as inputs to the states

q = the initial state = {A}

F = Accepting (or final) state = {C}

The transition table for the automaton is given by:






d

d




x

y


A

A

B


B

A

C


C

A

C



(i). Draw the corresponding transition diagram (digraph).

(ii). Provide 5 strings that are in the language generated by the automaton.

(iii). Provide 5 strings, that use the same inputs, which are not in the language generated by the automata.

(iv). Write a general statement that describes when a string is part of the language generated by the above automata and when that string is not in the language.


Related Discussions:- Discrete math

Instructions for cycles: loop, They transfer the process flow, provisionall...

They transfer the process flow, provisionally or totally, to a destiny, replicating this action until the counter is zero. LOOP LOOPE LOOPNE LOOP INSTRUCTION reason: To produce a c

Cryptography, Consider the one-time pad encryption scheme to encrypt a 1-bi...

Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the event "message

Ascii & unicode, ASCII code:  An alphanumeric code has to represent 10...

ASCII code:  An alphanumeric code has to represent 10 decimal digits, 26 alphabets and certain other symbols such as punctuation marks and special characters. Therefore, a min

Classify computer system according to capacity, classify computer system ac...

classify computer system according to capacity. how they are different from computer according to the classification of technology.provide the comparative study also.

Describe the binary search algorithm, QUESTION 1 Describe the binary se...

QUESTION 1 Describe the binary search algorithm using an example of your own. QUESTION 2 (a) By showing all your workings, give a big-O estimate for f(x) = (x + 1)lo

., why first generation computers are better than fourth generation compute...

why first generation computers are better than fourth generation computers

Uniform path cost search-artificial intelligence, Uniform Path Cost Search-...

Uniform Path Cost Search-Artificial intelligence A breadth first search will search the solution with the shortest path length from the first state to the goal state. Though, t

Algorithm - programming language, Algorithm : Once a problem has been defi...

Algorithm : Once a problem has been defined precisely, a procedure or process must be designed to produce the required output from the given input. Since a computer is a machine t

Write a detailed note on colour balance, Question 1 Write a long note on s...

Question 1 Write a long note on setting up a typical on-location News Interview Question  2 Write a long note on how to work with presenters Question 3 Write long notes

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