http://qs321.pair.com?node_id=1201912


in reply to Regex: matching character which happens exactly once

Just to further the theoretical aspect along...

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