in reply to Regex: matching character which happens exactly once
What would a TM program look like that recognizes such a string?
For instance, would it have to search backward and forward from each char position and count occurrences? Is there a better way?
-QM
--
Quantum Mechanics: The dreams stuff is made of
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Regex: matching character which happens exactly once
by LanX (Saint) on Oct 23, 2017 at 18:47 UTC | |
by QM (Parson) on Oct 24, 2017 at 09:08 UTC |
