Skip to main content

Timeline for Universal binary rewriting system

Current License: CC BY-SA 3.0

8 events
when toggle format what by license comment
Jul 23, 2015 at 2:10 answer added r.e.s. timeline score: 3
Jul 22, 2015 at 21:42 history edited user76284 CC BY-SA 3.0
added 217 characters in body
Jul 8, 2015 at 20:57 comment added babou I understood your question as being about string rewriting systems, such as Chomsky type 0 grammars (Semi-Thue grammars). But none of the solutions being considered seems to fit. What did you precisely mean by "rewriting system from binary strings to binary strings"? For Chomsky type 0 grammars, I do not see how it can be achieved, unless the input is first encoded with another device.
Jul 7, 2015 at 19:58 history edited user76284 CC BY-SA 3.0
edited title
Jul 7, 2015 at 19:38 history edited D.W. CC BY-SA 3.0
added 179 characters in body
Jul 7, 2015 at 19:36 answer added D.W. timeline score: 6
Jul 7, 2015 at 16:42 review First posts
Jul 7, 2015 at 17:25
Jul 7, 2015 at 16:40 history asked user76284 CC BY-SA 3.0