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

Computer Networking Scenario help, The project designs a school computer la...

The project designs a school computer lab with the necessary hardware and software components along with the IP address for different components. The computer lab consists of one I

The central processing unit (cpu), THE CENTRAL PROCESSING UNIT (CPU): T...

THE CENTRAL PROCESSING UNIT (CPU): The CPU is the heart of any computing system.  It executes the individual machine instructions, which make up a program. The CPU is formed fr

Identify important elements of multimedia, Problem 1 Identify important...

Problem 1 Identify important elements of Multimedia and explain with example. Stating important elements of Multimedia with example of each Problem 2 Explain a

Definition of User-Level Thread?, User-level threads apply in user-level li...

User-level threads apply in user-level libraries, before via systems calls, so thread switching does not require to call operating system and to cause interrupt to the kernel. Actu

Counters and registers, design a synchronous, recycling, MOD-12 counter wit...

design a synchronous, recycling, MOD-12 counter with D FF''s. Use the states 0000 through 1011 in the counter.

Unspecified bit rate, ATM Theory - Unspecified Bit Rate Is intended for no...

ATM Theory - Unspecified Bit Rate Is intended for non-real time applications, that is, those not requiring tightly constrained delay and delay variation. Examples of applications

Basic of simulation, Task 1 Study various types of systems and simulate a s...

Task 1 Study various types of systems and simulate a system of your own. Task 2 Study various models and enumerate the various steps for designing a corporate model

C language, parent and child process using c language

parent and child process using c language

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