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

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

What is Router. Explain Network Router, A router is a device which has play...

A router is a device which has played an important role in the development and existence of the Internet. Routers are designed to transmit data from other network users to specific

Time and space tradeoffs in search, Time and Space Tradeoffs in search-arti...

Time and Space Tradeoffs in search-artificial intelligence: In practice, you need to stop your agent at some stage if it has not searched a solution by then. However, if we can

Wide area networks and metropolitan area networks, Metropolitan Area Networ...

Metropolitan Area Networks : These type of networks generally cover specific metropolitan area and provide to them all the services.  Wide Area Networks (WANs): Wide Are

Mini computers and micro computers, Mini Computers and Micro Computers: ...

Mini Computers and Micro Computers: The mini computers are intermediate in power, and may function as small mainframe computers. They are often dedicated to a particular purpo

Types of browsers, Types of Browsers: Line Mode Browsers : The initia...

Types of Browsers: Line Mode Browsers : The initial browsers were line mode text browsers. These browsers were simple and used to display text line by line. They used to prov

Define virtualization, Question 1 Define virtualization. Discuss the benef...

Question 1 Define virtualization. Discuss the benefits of virtualization. Discuss the benefits of server virtualization Question 2 What is para virtualization? How para vi

Computer architecture, Subject Name CIT2193 COMPUTER ARCHITECTURE Topic AS...

Subject Name CIT2193 COMPUTER ARCHITECTURE Topic ASSIGNMENT Due Date 16 March 2012 Name : ……….…………………….……………….. Lecturer : ................................. Intake : ………………….

Define Shortest-Job-First (SJF) Scheduling ?, • It is also known as Shortes...

• It is also known as Shortest-Process-Next (SPN). • Shortest-Job-First (SJF) is a non-preemptive order in which waiting job (or process) with the smallest predictable run-time-to-

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