The following is a list of statements about deterministic finite automata and regular languages. Select all statements from below that are true. OSuppose language Lis regular. If a DFA M recognizes L, then for any string w E E*, M will decide whether w E Lafter exactly w| transitions. O A valid DFA may have unreachable states. O Suppose there are two DFAS that recognize languages L and L2, respectively. It may be the case that Lin L2 is regular, but it is also possible that this language is not regular. O For a DFA M = (Q, E, 5, qs, F), it may be the case that e e E. O The transition function & of a DEA may be continUOUS

The following is a list of statements about deterministic finite automata and regular languages. Select all statements from below that are true. OSuppose language Lis regular. If a DFA M recognizes L, then for any string w E E*, M will decide whether w E Lafter exactly w| transitions. O A valid DFA may have unreachable states. O Suppose there are two DFAS that recognize languages L and L2, respectively. It may be the case that Lin L2 is regular, but it is also possible that this language is not regular. O For a DFA M = (Q, E, 5, qs, F), it may be the case that e e E. O The transition function & of a DEA may be continUOUS

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Design a deterministic finite state automaton (DFA) that accepts exactly the strings over the alphabet {A, B, ...,Z} that contain at least two R, at most one T, and where every E comes after some S (there may be other letters in between). For instance, your DFA should accept the strings: • MYSTICWARRIORS • MARSMATRIX • SHOCKTROOPERS • CONTRAHARDCORPS STRIDER but not the strings • CRAZYTAXI (it does not contain at least two Rs) LASTRESORT (it contains more than one T) AFTERBURNER (there are Es without a S somewhere before them) • BATTLECIRCUIT (all of these at the same time) Clearly indicate the meaning of each state. One way to do this is to number the states and have a numbered list of their meanings, but any readable method you use to label and explain your states is fine. Hint: there are three separate conditions accepted strings must meet; states will need to encode whether or not each one is met (or perhaps partially met). You can label an edge with the word “else" to indicate it…
Consider the following regular expression over alphabet Σ = {a,b,c}: Σ∗a+Σ∗bc Provide two strings that are in the language L and two strings that are not in the language L. w∈L: w∈L: w /∈L: w /∈L:
Σ={a, b}
Draw a deterministic finite automaton (DFA) that recognizes the language consisting of strings overthe alphabet {a,b} which contain either exactly two a's (which need not be consecutive) and anynumber of b's, or exactly two b's (which need not be consecutive) and any number of a's (and containsonly such strings.) Use JFLAP and submit the saved file.
1
18
Use the Pumping Lemma to show the following language L is NOT regular. L= {w E (a, b, c}* ; where w has equal number of a's, b's, and c's}
We have introduced some languages involving DFA/NFA that are decidable. For example, we have introduced EDFA = {{B)|B is a DFA and L(B) = Ø}, which can be decide by a TM DEDFA . We can construct TM DEDFA in this way: given (B), DEDFA will mark the states of B to check whether finally any accept state can be marked. Furthermore, we have used this TM DEDFA to construct a TM decider for another language EQDFA = {{A,B)| A,B are DFAS and L(A) = L(B)}. See the allowed lecture slides for details. Now, follow this idea, use this DEDFA to construct another Turing machine DSUB that decide the language SUBDFA = {(A,B>| A,B are DFAS, L(A) C L(B)}.
Please don't copy
Consider the decidable language ALLNFA= {IN is a NFA and N accepts all strings over }. Construct the decider for the language ALLNFA.
Let Σ = {0, 1}. We define the language L5−8={⟨A⟩∣A is a deterministic finite automaton and 5≤∣L(A)∣≤8}L_{5-8} = \{ \langle A \rangle \mid A \text{ is a deterministic finite automaton and } 5 \leq |L(A)| \leq 8 \}L5−8={⟨A⟩∣A is a deterministic finite automaton and 5≤∣L(A)∣≤8} Prove that L5−8L_{5-8}L5−8 is a decidable language
Hi Could you kindly assist with the following question, Topic : Theoretical Computer Sciences and Computer Engineering Question 7