I was trying to find info about this Finite Automata type FAB (Finite Automata Bowl) and wasn't able to find a lot. It is basically the rules that are apply to PDA are apply to FAB except you drop the temporal order of the stack. So instead of being restricted to only removing the top symbol of the stack, you can remove any symbol of the bowl. The
The question is, isdoes there exist a CFcontext-free language that is notnot accepted by an FAB?? Thanks for whoever can help! much appreciated!