Timeline for Can a Turing Machine decide if a regular expression matches all strings of exactly some length $l \geq 1$?
Current License: CC BY-SA 3.0
1 event
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 2, 2013 at 7:22 | history | answered | Raphael | CC BY-SA 3.0 |