search
Log In
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
0 votes
14 views

 

For any given NFA with ip_set = {a,b} if any transaction is Missing then can we assume a Self Loop ? 

For example, 

  [T1] a b   [T2] a b
  S S,P Q   S S,P Q
is P _ Q same as  P P Q
  Q* _ _   Q* Q Q

 

Notice in T1 for transaction(P,a) = undefined. So can we assume transaction(P,a) = P ?

in Theory of Computation 5 points 14 views

1 Answer

0 votes
No, NFA doesn’t explicitly have a trap state and all transitions that are undefined shouldn’t be taken as a self-loop but rather should be considered leading to an imaginary trap state.

Note, this is only for normal NFAs not $\epsilon$-NFAs.
5 points
...