A characterization of boolean closures of families of languages. - Detlef Wotschke (Automatentheorie und Formale Sprachen, 1973)

The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages. - Detlef Wotschke (GI Jahrestagung, 1973)

Degree-Languages, Polynomial Time Recognition, and the LBA Problem - Detlef Wotschke (STOC, 1975)

The Influence of Productions on Derivations and Parsing. - Benton L. Leong; Detlef Wotschke (POPL, 1976)

Degree-Languages: A New Concept of Acceptance. - Detlef Wotschke (J. Comput. Syst. Sci., 1977)

Size, Index, and Context-Sensitivity of Controlled Partition Grammars. - Eva-Maria Mückstein Wotschke; Detlef Wotschke; Peter J. Downey (Math. Syst. Theory, 1977)

States Can Sometimes Do More Than Stack Symbols in PDA's. - John K. Price; Detlef Wotschke (ICALP, 1978)

A Note on Classes of Complements and the LBA Problem. - Detlef Wotschke; Celia Wrathall (Acta Informatica, 1978)

Nondeterminism and Boolean Operations in PDAs. - Detlef Wotschke (J. Comput. Syst. Sci., 1978)

On Strict Interpretations of Grammar Forms. - Seymour Ginsburg; Benton L. Leong; Otto Mayer; Detlef Wotschke (Math. Syst. Theory, 1979)

Amounts of Nondeterminism in Finite Automata. - Chandra M. R. Kintala; Detlef Wotschke (Acta Informatica, 1980)

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

On Reducing the Number of States in a PDA. - Jonathan Goldstine; John K. Price; Detlef Wotschke (Math. Syst. Theory, 1982)

A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? - Jonathan Goldstine; John K. Price; Detlef Wotschke (Theor. Comput. Sci., 1982)

Economy of Description for Program Schemes -Extended Abstract-. - Peter Drum; Detlef Wotschke (FCT, 1983)

Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). - Chandra M. R. Kintala; Detlef Wotschke (STACS, 1986)

On Measuring Nondeterminism in Regular Languages - Jonathan Goldstine; Chandra M. R. Kintala; Detlef Wotschke (Inf. Comput., 1990)

On the Relation between Ambiguity and Nondeterminism in Finite Automata - Jonathan Goldstine; Hing Leung; Detlef Wotschke (Inf. Comput., 1992)

On Reducing the Number of Stack Symbols in a PDA. - Jonathan Goldstine; John K. Price; Detlef Wotschke (Math. Syst. Theory, 1993)

Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata. - Chandra M. R. Kintala; Kong-Yee Pun; Detlef Wotschke (Math. Syst. Theory, 1993)

Editorial. - Jürgen Dassow; Detlef Wotschke (J. Autom. Lang. Comb., 2000)

On the size of parsers and LR(k)-grammars. - Hing Leung; Detlef Wotschke (Theor. Comput. Sci., 2000)

Editorial. - Jürgen Dassow; Detlef Wotschke; Bernd Reichel (J. Autom. Lang. Comb., 2002)

Descriptional Complexity of Machines with Limited Resources. - Jonathan Goldstine; Martin Kappes; Chandra M. R. Kintala; Hing Leung; Andreas Malcher; Detlef Wotschke (J. Univers. Comput. Sci., 2002)

Editorial. - Jürgen Dassow; Helmut Jürgensen; Detlef Wotschke (J. Autom. Lang. Comb., 2004)

Measuring nondeterminism in pushdown automata. - Jonathan Goldstine; Hing Leung; Detlef Wotschke (J. Comput. Syst. Sci., 2005)

Editorial. - Giovanni Pighizzini; Detlef Wotschke (J. Autom. Lang. Comb., 2007)

The Boolean closure of linear context-free languages. - Martin Kutrib; Andreas Malcher; Detlef Wotschke (Acta Informatica, 2008)

Descriptional Complexity of Splicing Systems. - Remco Loos; Andreas Malcher; Detlef Wotschke (Int. J. Found. Comput. Sci., 2008)

Remembering Chandra Kintala - Martin Kappes; Andreas Malcher; Detlef Wotschke (DCFS, 2010)

In Memoriam Chandra Kintala. - Martin Kappes; Andreas Malcher; Detlef Wotschke (Int. J. Found. Comput. Sci., 2012)