Timeline for What is Finite Automata Bowl?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 2, 2014 at 8:00 | history | tweeted | twitter.com/#!/StackCompSci/status/451267960485990400 | ||
| Mar 31, 2014 at 7:59 | comment | added | Raphael | Where did you find this automaton? Please give a reference, and/or a full formal (!) definition of the concept. For instance, can "we" choose the symbol to be removed, is it non-deterministic, ...? | |
| Mar 31, 2014 at 7:58 | history | edited | Raphael | CC BY-SA 3.0 |
deleted 42 characters in body; edited tags; edited title
|
| Mar 30, 2014 at 22:39 | comment | added | Joey Eremondi | Out of curiosity, where does your definition of a Bowl machine come from? If it's equivalent to a counter machine, I'm curious why it has a different name... | |
| Mar 30, 2014 at 21:02 | comment | added | babou | It does recognize all CF languages, and much more. The order in the stack is actually a restrictive constraint. | |
| Mar 30, 2014 at 17:58 | answer | added | babou | timeline score: 4 | |
| Mar 30, 2014 at 12:54 | answer | added | sjmc | timeline score: 0 | |
| Mar 27, 2014 at 18:51 | comment | added | Jackie | Well I guess this model will not accept any CF language that the order of the symbols is important... like palindromes ... | |
| Mar 27, 2014 at 16:59 | comment | added | Jackie | just like PDA, we can push lambda, or we can read lambda (mot reading any symbol from the input). We permit FAB to test for its bowl being empty. Just like PDA we can write an transaction in which only if the bowl is empty, we can use this transaction | |
| Mar 27, 2014 at 16:58 | comment | added | Jackie | Sure. FAB (Finite Automata Bowl) = A bowl functions similar to a stack, except we give up the temporal order of the stack symbols. We can remove any symbol instead of being restricted to only removing the top symbol of the stack. We can not distinguish whether we first put it the symbol A and then afterward the symbol B, or whether we first put the symbol B and then the symbol A. | |
| Mar 27, 2014 at 15:34 | comment | added | David Richerby | Could you give a more precise description of how this automaton works? | |
| Mar 27, 2014 at 15:12 | review | First posts | |||
| Mar 27, 2014 at 15:34 | |||||
| Mar 27, 2014 at 14:56 | history | asked | Jackie | CC BY-SA 3.0 |