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

match the following

Caption

 

asked in Theory of Computation by (103 points)
edited by | 58 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 (25.3k points)

Related questions

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
47,894 questions
52,260 answers
182,165 comments
67,679 users