Consider the finite automaton M₁ and answer the following questions. 91 a a, b b 92 93 a (a) What is the start state? (b) What is the set of accept states? (c) What sequence of states does M₁ go through on input abab? (d) Does M₁ accept the string abab? (e) Does M₁ accept the empty string, €? (f) Define M₁ formally.

Consider the finite automaton M₁ and answer the following questions. 91 a a, b b 92 93 a (a) What is the start state? (b) What is the set of accept states? (c) What sequence of states does M₁ go through on input abab? (d) Does M₁ accept the string abab? (e) Does M₁ accept the empty string, €? (f) Define M₁ formally.

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

i need the answer quickly
I need 3 answers
Consider the following finite-state automaton A over E = {a, b, c}: A = (E, {qo, 91; 92, 93 } , 8, 90, {92}) %3D where d = {(q0, a, q1), (q1, b, q0), (q1, b, q2), (q2, a, 91), (92, b, q2), (q2, a, q3), (q3, c, q3), (q3, a, q2)}. Draw the automaton A as a transition graph.
Consider the following Nondeterministic Finite Automaton (NFA). 1 Paragraph b b b b BI 3 a 4 b b (a) What are the possible states that this NFA could be in, after reading the input string bbb? (b) Prove, by induction on n, that for all positive integers n, the string (bbb)" is accepted by this NFA. (This string is obtained by n repetitions of bbb.) 20 30 a 2
The multiplicative digital root of a natural number n is the product of its digits. For instance, the multiplicative digital root of 153 is 1-5-3 = 15. Draw a 3-state deterministic finite automaton with alphabet E = (3,4,5) that accepts the following language: L= {w | the multiplicative digital root of w is divisible by 8} The automaton shall not accept the empty string.
Consider the following language assuming ∑ = {a, b} The total number of a's are even including null The a's can be either consecutive or non-consecutive The number of b's are not restricted, i.e. any number of b's Build an FA using minimum number of states. Write a regular expression. Justify your answers with examples (abbabaa, aaaa, abababab bbb are acceptd; bababbba and bbbaaa, aaa are NOT accepted).
For each of the following regular expressions over Σ = {a, b}, state 5 strings that are in the language of the regular expression, and 5 strings that are not. 1. (a∗b)∗|a∗2. (Σ∗aaΣ∗)|(Σ∗bbΣ∗)|(ab)∗|(ba)∗|a|b
b) Given a state table as below, where S = {o0, 01, 02, 03}, I = {a, b, c} and F = {o0, 02}. %3D f b I a S σι 02 σι 02 02 03 σι σι σι i. Draw the transition diagram of the finite-state automaton (S, I, f, 00, F). Determine whether the following strings are accepted by the Deterministic Finite Automata (DFA) or not. • abaabbc • abbccbab
Let E= {0,1}. Give a regular expression r over Σ such that L(r) = { w in Σ* | (w contains at least 2 symbols, that is, the length of w is at least 2) and (the first symbol of w is different from the last symbol of w) and (centre (w) is mimsy according to the following two definitions)}. For any string y containing at least 2 symbols, let centre (y) be the substring of y obtained by removing the first symbol and the last symbol of y. A string x over Σ is called mimsy if x is made up of either • at least two 0-symbols (and no 1-symbols), or • an even number of 1-symbols (and no 0-symbols).
a) Determine which of the following sets have valid/invalid alphabets:Σ1= {a, ab, b, d, be}Σ2= {a, bc, ce, da} b) Consider Σ= {a, bac, ca, de, f} to find the length of the string s=bacdeacadef by tokenizing. Give its reverse Rev (s).
Please give me correct solution for this question and fast.
Consider the Finite Automata D in Figure 2. a. List 3 strings of different lengths that D accepts and also 3 that it rejects. b. What is the shortest string that D accepts? What is the shortest string that D rejects? c. Describe, in your own words, what is the language of D, i.e., L(D). 93 42 Figure 2. Finite automata D