Drawing a NFSA with 6 States: Is it Possible?

  • Thread starter Thread starter flying2000
  • Start date Start date
  • Tags Tags
    Drawing States
Click For Summary
SUMMARY

The discussion centers on the feasibility of constructing a Non-deterministic Finite State Automaton (NFSA) with six states to recognize strings composed of '0's and '1's that end with a symbol occurring an even number of times. The regular expression proposed is (0*10*1)*(0*10*1) + (1*01*0)*(1*01*0), which initially requires seven states. However, a participant claims to have devised a solution using only six states to accept strings ending in both '0' and '1' with even occurrences. Clarifications regarding the terminology of NFSA and NFA are also discussed, emphasizing the importance of understanding these concepts in formal language theory.

PREREQUISITES
  • Understanding of Non-deterministic Finite Automata (NFA)
  • Familiarity with regular expressions
  • Basic knowledge of formal language theory
  • Concept of state transitions in automata
NEXT STEPS
  • Research the construction of Non-deterministic Finite Automata (NFA) with specific state requirements
  • Explore the implications of regular expressions in automata theory
  • Study the differences between NFSA and NFA terminologies in academic contexts
  • Investigate the role of state modifications in automata design
USEFUL FOR

This discussion is beneficial for computer science students, automata theorists, and anyone interested in the design and analysis of finite state machines, particularly in the context of formal languages and automata theory.

flying2000
Messages
40
Reaction score
0
Is that possible using six states to draw a NFSA(NFA) to represent a string ending with a symbol which occurred even times in this string(this string is consisted of only 0 and 1)..

I thought that the regular expression is (0*10*1)*(0*10*1) + (1*01*0)*(1*01*0), It can be easy using 7 states to draw a NFSA, but I can't figure out a way only using 6 states..

Any help wiill be appreciated!
 
Physics news on Phys.org
What do "NFA" and "NFSA" mean?
 
it should be 'non-deterministic FSA '

non-deterministic FSA

Tom Mattson said:
What do "NFA" and "NFSA" mean?
 
I don't see why you would even need six states

http://osf1.gmu.edu/~craphae1/NFA.JPG
 
Last edited by a moderator:
flying2000 said:
non-deterministic FSA
Since most of us know SFA about FSA, perhaps you could expand the acronym so we can at least look it up to discover a new area of science/math that has eluded us up to now.

AM
 
Thanks

U r smart! man..
however, it seems that it only accepts the string end with 1 ocurred even times, not 0. and '01' is also accepted by it. it is not we wanted. Actually, After spending serveral nights on it. I also figure out a way using six states to accept a string end both 1 and 0 (occurring even times). Hope we can discuss it.
Any way, thanks a lot!

so-crates said:
I don't see why you would even need six states

http://osf1.gmu.edu/~craphae1/NFA.JPG
[/URL]
 
Last edited by a moderator:
sorry.

sorry about that, man. But if you google 'NFSA assignment', you will find that some people name it NFSA, most call it NFA. Since My professor call it NFSA, there is nothing I can do about it and I had to follow him.

Andrew Mason said:
Since most of us know SFA about FSA, perhaps you could expand the acronym so we can at least look it up to discover a new area of science/math that has eluded us up to now.

AM
 
Actually, you would need one small modification to make my NFA work... Are empty strings also part of the language ? In that case you would need an additional state.
 
flying2000 said:
sorry about that, man. But if you google 'NFSA assignment', you will find that some people name it NFSA, most call it NFA. Since My professor call it NFSA, there is nothing I can do about it and I had to follow him.
Thanks for the link. So how big, exactly, is this NFSA fire sprinkler? You haven't even given the pipe size. Or perhaps you are referring to a NFSA fishing line, in which case I would need the string length, wouldn't I?

AM
 

Similar threads

Replies
0
Views
2K
  • · Replies 29 ·
Replies
29
Views
4K
Replies
7
Views
1K
Replies
21
Views
4K
  • · Replies 31 ·
2
Replies
31
Views
5K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 25 ·
Replies
25
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K