A Note on a Problem in the Theory of Grammatical Complexity. - Walter Bucher (Theor. Comput. Sci., 1981)

Concise Description of Finite Languages. - Walter Bucher; Hermann A. Maurer; Karel Culík II; Detlef Wotschke (Theor. Comput. Sci., 1981)

Two-Symbol DOS Systems Generating Regular Languages. - Walter Bucher (Acta Informatica, 1983)

It is Decidable Whether a Regular Language is Pure Context-Free. - Walter Bucher; Johann Hagauer (Theor. Comput. Sci., 1983)

Theoretische Grundlagen der Programmiersprachen. - Walter Bucher; Hermann A. Maurer (BI-Wissenschaftsverlag, 1984)

On Real Time and Linear Time Cellular Automata. - Walter Bucher; Karel Culík II (RAIRO Theor. Informatics Appl., 1984)

Context-Free Complexity of Finite Languages. - Walter Bucher; Hermann A. Maurer; Karel Culík II (Theor. Comput. Sci., 1984)

On Total Regulators Generated by Derivation Relations. - Walter Bucher; Andrzej Ehrenfeucht; David Haussler (ICALP, 1985)

Applications of an Infinite Squarefree CO-CFL. - Michael G. Main; Walter Bucher; David Haussler (ICALP, 1985)

A Regularity Test for Dual Bordered OS Systems. - Walter Bucher (Acta Informatica, 1986)

Applications of an Infinite Square-Free CO-CFL. - Michael G. Main; Walter Bucher; David Haussler (Theor. Comput. Sci., 1987)