New Results on the Stack Ramification of Binary Trees
Nebel M (1997)
Journal of Automata, Languages and Combinatorics 2(3): 161--176.
Zeitschriftenaufsatz | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Einrichtung
Erscheinungsjahr
1997
Zeitschriftentitel
Journal of Automata, Languages and Combinatorics
Band
2
Ausgabe
3
Seite(n)
161--176
Page URI
https://pub.uni-bielefeld.de/record/2910045
Zitieren
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, Markus. 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.
Google Scholar