ZuoTi.Pro
Question

Design a determinsitic finite-state automaton that accepts strings(A,B,...,Z) must contain "NG" does not end with Y...

Design a determinsitic finite-state automaton that accepts strings(A,B,...,Z)

must contain "NG"

does not end with Y

any I must be followed by a S(after any number of other letters including another I).

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

AiB.C: P,S F CnM,SkLim,o, P,aiR,SIUVOX , A1B.CIPIEFIC, H, 5,kLim, NDPDIRIS VILOXI A.B CD/EFG,, S,kiLIMNIO, P,a,RIS,7,0,v,co,X

#if you have any doubt comment below...if you didn't understand anywhere just comment below...

0 0
Add a comment
Know the answer?
Add Answer to:
Design a determinsitic finite-state automaton that accepts strings(A,B,...,Z) must contain "NG" does not end with Y...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Any answer that involves a design for a Finite Automaton (DFA or NFA) should contain information...

    Any answer that involves a design for a Finite Automaton (DFA or NFA) should contain information about the following five components of the FA (corresponding to the 5-tuple description): i) The set of states Q; ii) the alphabet Σ; iii) the start state; iv) the set of final states F; v) the set of transitions δ, which can be either shown in the form of a state diagram (preferred) or a transition table. You can either present the answer in...

  • Compiler Design Please help me with this lexical analysis In C Using FInite automata and a...

    Compiler Design Please help me with this lexical analysis In C Using FInite automata and a driver. With file test scanner , main, scanner, token.h All case sensitive Each scanner error should display "Scanner Error:" followed by details including the line number ff available Alphabet all English letters (upper and lower), digits, plus the extra characters as seen below, plus WS No other characters allowed and they should generate errors Identifiers begin with a lower case letter and continue with...

  • Passwords for a certain computer system are strings of uppercase letters. A valid password must contain...

    Passwords for a certain computer system are strings of uppercase letters. A valid password must contain an even number of X’s. Determine a recurrence relation for the number of valid passwords of length n. Note: 0 is an even number, so ABBC is a valid password. This counting problem is pretty tricky. Here’s a good way to think about it: to make a good password of length n you can either (a) add any non-X to the end of a...

  • Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet...

    Part B - Automata Construction Draw a DFA which accepts the following language over the alphabet of {0,1}: the set of all strings such that the number of 0s is divisible by 2 and the number of 1s is divisible by 5. Your DFA must handle all intput strings in {0,1}*. Here is a methodical way to do this: Figure out all the final states and label each with the shortest string it accepts, work backwards from these states to...

  • 01.7) (13 pts) Modeling using a finite state machine. (a) (10 pts) Design and Draw a Vending Machine (VM) that acce...

    01.7) (13 pts) Modeling using a finite state machine. (a) (10 pts) Design and Draw a Vending Machine (VM) that accepts only I AED and selection of user input such as (Cola, or Masafa, or Cancel) and outputs COLA and MASAF bottles in addition to AEDs and Messages as needed The VM works as follows: It only starts providing COLA after all MASAFI are consumed. The price of MASAFI is 1 AED and the price of COLA is 2 AED....

  • I would like some assistance correcting an issue I am having with this assignment. Once a...

    I would like some assistance correcting an issue I am having with this assignment. Once a finite state automaton (FSA) is designed, its transition diagram can be translated in a straightforward manner into program code. However, this translation process is considerably tedious if the FSA is large and troublesome if the design is modified. The reason is that the transition information and mechanism are combined in the translation. To do it differently, we can design a general data structure such...

  • This question deals with NFAs, DFAs, and regular expressions. (a) Using only the symbols described in...

    This question deals with NFAs, DFAs, and regular expressions. (a) Using only the symbols described in the lecture slides, write a regular expression that describes all strings over the alphabet Σ = {0,1} that are at are at least four bits long and begin and end with the same bit. (b) Draw a DFA, that accepts strings strings over the alphabet Σ = {0, 1} such that if you read the string from left to right, the difference between the...

  • 1.Suppose that the goop function from the previous question changes the value of z[1]. Does this...

    1.Suppose that the goop function from the previous question changes the value of z[1]. Does this change effect the value of the actual argument? A. Yes B. No 2.Here is a function declaration: void goo(int* x) { *x = 1; } Suppose that a is an int* variable pointing to some integer, and *a is equal to zero. What is printed if you print *a after the function call goo(a)? A. 0 B. 1 C. address of a D. address...

  • Stacks and Java 1. Using Java design and implement a stack on an array. Implement the...

    Stacks and Java 1. Using Java design and implement a stack on an array. Implement the following operations: push, pop, top, size, isEmpty. Make sure that your program checks whether the stack is full in the push operation, and whether the stack is empty in the pop operation. None of the built-in classes/methods/functions of Java can be used and must be user implemented. Practical application 1: Arithmetic operations. (a) Design an algorithm that takes a string, which represents an arithmetic...

  • 3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa...

    3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT