Skip to content

Opening book details…

About this Computer Science article

Set-driven and Rearrangement-independent Learning of Recursive Languages by S. Lange, T. Zeugmann is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
S. Lange, T. Zeugmann
Publisher
Springer; Springer-Verlag; Springer Verlag; Springer Science and Business Media LLC (ISSN 1433-0490)
Published
1996
Field
Computer Science (Physical Sciences)

More by S. Lange, T. Zeugmann

Browse all works by S. Lange, T. Zeugmann