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

Assigment, how to measure marginal utility.?

how to measure marginal utility.?

Programming, create a simple Visual Basic project

create a simple Visual Basic project

Read only memory (rom), Read only memory (rom): The problem with RAM is...

Read only memory (rom): The problem with RAM is that its memory is volatile, i.e. it loses all its data when the power supply is removed.  A non-volatile memory is a permanent

Assembly language, write and run the following programs using 8086 assembly...

write and run the following programs using 8086 assembly language that interchange the upper and lower four bits of AL register.

Hill climbing - artificial intelligence , Hill Climbing - artificial intell...

Hill Climbing - artificial intelligence: As we've seen, in some particular problems, searching the search path from primly to goal state is the point of the exercise. In anothe

General considerations for search - artificial intelligence, General Consid...

General Considerations for Search If we may specify the starting state, the operators and the goal check for a search problem, then we know from where to start, how to move and

Network, Give a topology (network diagram) in which there is a link whose f...

Give a topology (network diagram) in which there is a link whose failure will change many routes. Give one in which there is a link whose failure will not change any routes

Programming, write a program to display the first ten terms of the series 2...

write a program to display the first ten terms of the series 2,5,10,17,...........

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