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

Data structures, let me know if you can do this assignment and how long it ...

let me know if you can do this assignment and how long it takes

Analyze the complexity of dijkstra''s algorithm, QUESTION (a) Given the...

QUESTION (a) Given the graph as shown in figure, apply Lagrangian technique to complete the table assuming μ=1 and T=14                        Path P

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.

Determine recursive c function computes, QUESTION (a) Give the two cond...

QUESTION (a) Give the two conditions required by a binary tree of depth d to be an almost complete binary tree. (b) Determine what the following recursive C function compute

C++ programming, write a program of 2 sum and 2 product number in C++ progr...

write a program of 2 sum and 2 product number in C++ programming language

Computer generations, Computer Generations: From the early 1940's to t...

Computer Generations: From the early 1940's to the present, computer scientists have been able to identify clear-cut stages in the development of computer technology. With eac

Execution of a machine instruction, Execution of a machine instruction: ...

Execution of a machine instruction: Execution of a machine instruction on modern processors involves a complex sequence of operations with multiple cycles. One instruction cyc

Introduction to Computer and Programming Concept, Classify computer systems...

Classify computer systems according to capacity. How they are different from computers according to the classification of technology. Provide comparative study also.

Multi-valued attribute dbms, Multi-valued Attribute DBMS Each multi valued ...

Multi-valued Attribute DBMS Each multi valued attribute maps into a separate table. Include also an attribute for the primary key of the entity and relationship type which the attr

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