The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
57 views
how to draw dfa for this?

L= {w: there are at most two runs of a’s of length three}.
asked in Theory of Computation by Active (1.6k points) | 57 views
0

that means there are two go of a, and each go contains consecutive 3 a's

https://www.scribd.com/doc/74166375/Homework-1

0

srestha i disagree. The dfa can accept all strings except the ones having more than 2 runs of 3 a's. 

for example : aaabaaabaaa. 

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

35,518 questions
42,792 answers
121,605 comments
42,162 users