Talk:Bitwise Cyclic Tack

This shouldn't be stronger than a FSA because for ever iteration only finite elements on stack top matters. So you can use it as a state to make any FSA Cleverxia (talk) 13:49, 20 January 2026 (UTC)

If we say the stack is 1, and the program is 11, then it's a looping counter minus output. The stack grows as 1 11 111 1111 .... An FSA can never do that. PDA's DO only have a finite number of elements relevant at any times, but the pop makes a new element that was remembered relevant instead! --Yayimhere2(school) (talk) 14:33, 20 January 2026 (UTC)

Nope. a intepreter can just keep the first some bits on the stack and not cnsume infinite menory.

Have you heard of a PDA??? --Yayimhere2(school) (talk) 13:26, 9 February 2026 (UTC)

Because if the program, "randomly" then just begins popping off the stack, you'll have lost info. --Yayimhere2(school) (talk) 13:27, 9 February 2026 (UTC)