Difference between revisions of "Talk:Formal language, machine-representable"
From Encyclopedia of Mathematics
(→Magazine memory: So the correct terminology here would be "push-down automaton" and "stack memory"?) |
(→Magazine memory: sorry, just the opposite) |
||
| Line 3: | Line 3: | ||
:Yes, "stack", and not "pushdown"; see [https://en.wikipedia.org/wiki/Pushdown_automaton WP:Pushdown automaton] ("stack automaton, by contrast, does allow...") and the corresponding [https://ru.wikipedia.org/wiki/%D0%90%D0%B2%D1%82%D0%BE%D0%BC%D0%B0%D1%82_%D1%81_%D0%BC%D0%B0%D0%B3%D0%B0%D0%B7%D0%B8%D0%BD%D0%BD%D0%BE%D0%B9_%D0%BF%D0%B0%D0%BC%D1%8F%D1%82%D1%8C%D1%8E rusWP:Автомат с магазинной памятью] (literally, "magazine memory automation"). [[User:Boris Tsirelson|Boris Tsirelson]] ([[User talk:Boris Tsirelson|talk]]) 22:56, 29 October 2017 (CET) | :Yes, "stack", and not "pushdown"; see [https://en.wikipedia.org/wiki/Pushdown_automaton WP:Pushdown automaton] ("stack automaton, by contrast, does allow...") and the corresponding [https://ru.wikipedia.org/wiki/%D0%90%D0%B2%D1%82%D0%BE%D0%BC%D0%B0%D1%82_%D1%81_%D0%BC%D0%B0%D0%B3%D0%B0%D0%B7%D0%B8%D0%BD%D0%BD%D0%BE%D0%B9_%D0%BF%D0%B0%D0%BC%D1%8F%D1%82%D1%8C%D1%8E rusWP:Автомат с магазинной памятью] (literally, "magazine memory automation"). [[User:Boris Tsirelson|Boris Tsirelson]] ([[User talk:Boris Tsirelson|talk]]) 22:56, 29 October 2017 (CET) | ||
::So the correct terminology here would be "push-down automaton" and "stack memory"? [[User:Richard Pinch|Richard Pinch]] ([[User talk:Richard Pinch|talk]]) 23:24, 29 October 2017 (CET) | ::So the correct terminology here would be "push-down automaton" and "stack memory"? [[User:Richard Pinch|Richard Pinch]] ([[User talk:Richard Pinch|talk]]) 23:24, 29 October 2017 (CET) | ||
| + | :::Oops, I am very sorry, I was terribly not careful; I mean just the opposite: "pushdown", and not "stack"! [[User:Boris Tsirelson|Boris Tsirelson]] ([[User talk:Boris Tsirelson|talk]]) 07:12, 30 October 2017 (CET) | ||
Latest revision as of 06:12, 30 October 2017
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)
- Oops, I am very sorry, I was terribly not careful; I mean just the opposite: "pushdown", and not "stack"! Boris Tsirelson (talk) 07:12, 30 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