Assignment #3 Consider the Deterministic Finite Automaton M Correct Answers

An assignment analyzing the deterministic finite automaton with correct solutions.

Benjamin Clark
Contributor
4.0
40
5 months ago
Preview (2 of 4 Pages)
100%
Purchase to unlock

Page 1

Assignment #3 Consider the Deterministic Finite Automaton M Correct Answers - Page 1 preview image

Loading page image...

Assignment #3Considerthe Deterministic Finite Automaton M CorrectAnswers1.ConsiderthedeterministicfiniteautomatonM=({q1,q2,q3},{0,1},δ,q1,{q2})whereδisdefinedasfollows:δ(q1,0)=q1δ(q1,1)=q2δ(q2,0)=q3δ(q2,1)=q2δ(q3,0)=q2δ(q3,1)=q2Writeanequivalentregularexpression.2.Provethatthefollowinglanguagesarenotregularsets:(a)L={aibjck|i=0j=k,i,j,k0}.Examplestringsincludebccc,abbcc,aaa,etc.+(b)L={ww|w{0,1}}.Examplestringsinclude00,11,0101,010010,etc.n(c)L={a2|n0}.Examplestringsincludeaaaa,a16,a64,etc.(d)L={w|w{0,1},wisoftheform(0i1)n,fori=1,2,...,n,n0}.Thestringsofthislanguage areε,01,01001,010010001,....,eachsuccessivestringof0’sbeingonelargerthantheprevious.3.FindtheminimumstatefiniteautomatonforthelanguagespecifiedbythefiniteautomatonM=({q0,q1,q2,q3},{0,1},δ,q0,{q0})whereδisdefinedasfollows:

Page 2

Assignment #3 Consider the Deterministic Finite Automaton M Correct Answers - Page 2 preview image

Loading page image...

Preview Mode

This document has 4 pages. Sign in to access the full document!

Study Now!

XY-Copilot AI
Unlimited Access
Secure Payment
Instant Access
24/7 Support
Document Chat

Document Details

Related Documents

View all