About the derivation languages of grammars and machines
In: Automata, languages and programming, Jg. 4.1977, S. 337-351
Characterizations of time-bounded computations by limited primitive recursion
In: Automata, languages and programming, Jg. 2.1974, S. 280-293The complexity of embedding graphs into binary trees
In: Fundamentals of computation theory, Jg. 5, S. 300-309On a subclass of pseudopolynomial problems
In: Mathematical Foundations of Computer Science, Jg. 9, S. 414-425Relationships between pushdown automata and tape-bounded turing machines
In: Automata, languages and programming, Jg. 1973, S. 575-583Simulating binary trees on x-trees
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures / Symposium on Parallel Algorithms and Architectures <3, 1991, Hilton Head Island, SC>, S. 147-158