New Results on the Stack Ramification of Binary Trees
Nebel M (1997)
Journal of Automata, Languages and Combinatorics 2(3): 161--176.
Download
No fulltext has been uploaded. References only!
Journal Article
| English
No fulltext has been uploaded
Author
Department
Publishing Year
PUB-ID
Cite this
Nebel M. New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics. 1997;2(3):161--176.
Nebel, M. (1997). New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics, 2(3), 161--176.
Nebel, M. (1997). New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics 2, 161--176.
Nebel, M., 1997. New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics, 2(3), p 161--176.
M. Nebel, “New Results on the Stack Ramification of Binary Trees”, Journal of Automata, Languages and Combinatorics, vol. 2, 1997, pp. 161--176.
Nebel, M.: New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics. 2, 161--176 (1997).
Nebel, Markus. “New Results on the Stack Ramification of Binary Trees”. Journal of Automata, Languages and Combinatorics 2.3 (1997): 161--176.
This data publication is cited in the following publications:
This publication cites the following data publications:
Google Scholar