Timeline for Smallest NFA accepting concatenations of two words of the length $k$ which are different at all positions
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2014 at 9:23 | vote | accept | R B | ||
| Aug 28, 2014 at 9:23 | |||||
| Jul 16, 2014 at 22:58 | history | edited | D.W.♦ | CC BY-SA 3.0 | added 183 characters in body |
| Jul 16, 2014 at 17:11 | comment | added | D.W.♦ | @RB, OK, no problem! Your construction is nicer. You might want to edit your question to mention that in your application $k \ll |\Sigma|$. | |
| Jul 16, 2014 at 16:49 | comment | added | R B | Thanks @D.W. for the answer. It is a nice construction, but in my application $k<<|\Sigma|$. | |
| Jul 16, 2014 at 16:44 | history | answered | D.W.♦ | CC BY-SA 3.0 |