Talk:Formal language, machine-representable
From Encyclopedia of Mathematics
Revision as of 22:24, 29 October 2017 by Richard Pinch (talk | contribs) (→Magazine memory: So the correct terminology here would be "push-down automaton" and "stack memory"?)
Magazine memory
I assume "magazine memory" means "stack" or "push-down" here? Richard Pinch (talk) 22:29, 29 October 2017 (CET)
- Yes, "stack", and not "pushdown"; see WP:Pushdown automaton ("stack automaton, by contrast, does allow...") and the corresponding rusWP:Автомат с магазинной памятью (literally, "magazine memory automation"). Boris Tsirelson (talk) 22:56, 29 October 2017 (CET)
- So the correct terminology here would be "push-down automaton" and "stack memory"? Richard Pinch (talk) 23:24, 29 October 2017 (CET)
How to Cite This Entry:
Formal language, machine-representable. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Formal_language,_machine-representable&oldid=42229
Formal language, machine-representable. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Formal_language,_machine-representable&oldid=42229