Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones

Wilfried Brauer, Klaus-Jörn Lange. Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. In Kurt Mehlhorn, editor, STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings. Volume 182 of Lecture Notes in Computer Science, pages 71-79, Springer, 1985.

Abstract

Abstract is missing.