On a characterization of pushdown permuters

DOI10.1016/0304-3975(82)90029-9MaRDI QIDQ1165002zbMATH OpenOpenAlexFDO

Authors R. K. Shyamasundar

Publication date 1982

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(82)90029-9

zbMATH Keywords

arithmetic expressionsfinite number of random access storage cellspermutations of input symbolssingle push-down stack

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• A Counterexample to Reingold’s Pushdown Permuter Characterization Theorem
• Infix to Prefix Translation: The Insufficiency of a Pushdown Stack

Cited in

(1)

• A counterexample to Shyamasundar's characterization of pushdown permuters

This page was built for publication: On a characterization of pushdown permuters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165002)