Timeline for Given an automatic set $S$ coming from a DFA $M$ when read little-endian, is $\overline{d}(S)$ at most the Büchi acceptance probability of $M$?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23 at 18:28 | history | edited | Harry Altman |
You know what I think this does belong in probability after all (alongside number theory)
|
|
| Apr 17 at 21:07 | answer | added | Sophie M | timeline score: 1 | |
| Apr 16 at 3:19 | history | edited | Harry Altman | CC BY-SA 4.0 |
reformulate question to use more standard notions!
|
| Apr 7 at 21:54 | history | edited | Harry Altman | CC BY-SA 4.0 |
add more explicit question about log density and big endian
|
| Apr 7 at 21:49 | history | edited | Harry Altman | CC BY-SA 4.0 |
expand on Markov chain-ness and failure thereof
|
| Apr 3 at 6:45 | history | edited | Harry Altman | CC BY-SA 4.0 |
clarify: not a Markov chain anymore
|
| Apr 2 at 16:17 | answer | added | Sophie M | timeline score: 0 | |
| Apr 2 at 4:55 | history | edited | Harry Altman | CC BY-SA 4.0 |
correct b-adic number -> b-adic integer
|
| Apr 1 at 22:38 | comment | added | Harry Altman | No, it accepts or rejects anywhere, but the accept/reject status of these other nodes doesn't affect the acceptance probability when you plug in a random infinite string. Which means if the answer to my question is yes, they don't affect the density. But if it's no, they might! | |
| Apr 1 at 20:03 | comment | added | Sophie M | I don't quite understand the model. Is the point that the DFA only accepts or rejects at a sink? If so, this seriously restricts the class of automatic sets/languages you can recognize --- it's equivalent to the language being a suffix code. | |
| Apr 1 at 5:04 | history | edited | Harry Altman |
change tags -- this is more a number theory question than a probability one
|
|
| Mar 30 at 1:47 | history | asked | Harry Altman | CC BY-SA 4.0 |