The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
48 views

match the following

Caption

 

asked in Theory of Computation by (103 points)
edited by | 48 views
0
Question is not visible.

1 Answer

+1 vote
  • In every state have input alphabet is define then it is DFA .otherwise it is NFA.

  1. IN first diagram input alphabet is not define . So it is NFA.and there is no final state so it is " NFA accepting nothing"

Simillary we can solve all

answered by Boss (24k points)


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

42,572 questions
48,563 answers
155,429 comments
63,581 users