Skip to main content
Computer Science

Return to Question

Question Protected by CommunityBot
edited tags
Link
Raphael
Raphael
  • 72.9k
  • 30
  • 181
  • 393
deleted 1 characters in body
Source Link
asheeshr
asheeshr
  • 221
  • 1
  • 2
  • 11

This is a homework question, so I am only looking for hints.

I got a question in an assignmentsassignment which states :

Design a DFA that accepts strings having 1 as the 4th character from the end, on the alphabet {0,1}

I have been at this for a few hours now, and I think that designing such a DFA is not possible. However, I am not sure how to move forward in this direction to write up a somewhat formal proof.

So, what should I try to do to prove or disprove my hypothesis?

This is a homework question, so I am only looking for hints.

I got a question in an assignments which states :

Design a DFA that accepts strings having 1 as the 4th character from the end, on the alphabet {0,1}

I have been at this for a few hours now, and I think that designing such a DFA is not possible. However, I am not sure how to move forward in this direction to write up a somewhat formal proof.

So, what should I try to do to prove or disprove my hypothesis?

This is a homework question, so I am only looking for hints.

I got a question in an assignment which states :

Design a DFA that accepts strings having 1 as the 4th character from the end, on the alphabet {0,1}

I have been at this for a few hours now, and I think that designing such a DFA is not possible. However, I am not sure how to move forward in this direction to write up a somewhat formal proof.

So, what should I try to do to prove or disprove my hypothesis?

Tweeted twitter.com/#!/StackCompSci/status/372920639596011520
Source Link
asheeshr
asheeshr
  • 221
  • 1
  • 2
  • 11

Designing a DFA that accepts strings such that nth character from last satisfies condition

This is a homework question, so I am only looking for hints.

I got a question in an assignments which states :

Design a DFA that accepts strings having 1 as the 4th character from the end, on the alphabet {0,1}

I have been at this for a few hours now, and I think that designing such a DFA is not possible. However, I am not sure how to move forward in this direction to write up a somewhat formal proof.

So, what should I try to do to prove or disprove my hypothesis?