Detlef Wotschke

Martin Kappes, Andreas Malcher, Detlef Wotschke: In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. 23(1): 5-19 (2012)

Martin Kappes, Andreas Malcher, Detlef Wotschke: Remembering Chandra Kintala. DCFS 2010: 15-26

Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean closure of linear context-free languages. Acta Inf. 45(3): 177-191 (2008)

Remco Loos, Andreas Malcher, Detlef Wotschke: Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. 19(4): 813-826 (2008)

Remco Loos, Andreas Malcher, Detlef Wotschke: Descriptional Complexity of Splicing Systems. DCFS 2007: 93-104

Jonathan Goldstine, Hing Leung, Detlef Wotschke: Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71(4): 440-466 (2005)

Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke (Eds.): 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings. Università degli Studi di Milano, Milan, Italy 2005

Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory 2004: 284-295

Lucian Ilie, Detlef Wotschke (Eds.): 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2004, isbn 0-7714-2506-6

Erzsébet Csuhaj-Varjú, Chandra M. R. Kintala, Detlef Wotschke, György Vaszil (Eds.): 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary 2003, isbn 963-311-356-3

Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke: Descriptional Complexity of Machines with Limited Resources. J. UCS 8(2): 193-234 (2002)

Jürgen Dassow, Maia Hoeberechts, Helmut Jürgensen, Detlef Wotschke (Eds.): Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21 - 24, 2002. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2002, isbn 0-7714-2388-8

Jürgen Dassow, Detlef Wotschke (Eds.): Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings. Fakultät für Informatik, Universität Magdeburg, Magdeburg, Germany 2001

Hing Leung, Detlef Wotschke: On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. 242(1-2): 59-69 (2000)

Jonathan Goldstine, Hing Leung, Detlef Wotschke: Measuring Nondeterminism in Pushdown Automata. STACS 1997: 295-306

Jonathan Goldstine, John K. Price, Detlef Wotschke: On Reducing the Number of Stack Symbols in a PDA. Mathematical Systems Theory 26(4): 313-326 (1993)

Chandra M. R. Kintala, Kong-Yee Pun, Detlef Wotschke: Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata. Mathematical Systems Theory 26(4): 379-395 (1993)

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

Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke: On Measuring Nondeterminism in Regular Languages. Inf. Comput. 86(2): 179-194 (1990)

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

Peter Drum, Detlef Wotschke: Economy of Description for Program Schemes -Extended Abstract-. FCT 1983: 475-486

Jonathan Goldstine, John K. Price, Detlef Wotschke: On Reducing the Number of States in a PDA. Mathematical Systems Theory 15(4): 315-321 (1982)

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

Walter Bucher, Hermann A. Maurer, Karel Culik II, Detlef Wotschke: Concise Description of Finite Languages. Theor. Comput. Sci. 14: 227-246 (1981)

Chandra M. R. Kintala, Detlef Wotschke: Amounts of Nondeterminism in Finite Automata. Acta Inf. 13: 199-204 (1980)

Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke: On Strict Interpretations of Grammar Forms. Mathematical Systems Theory 12: 233-252 (1979)

Detlef Wotschke, Celia Wrathall: A Note on Classes of Complements and the LBA Problem. Acta Inf. 10: 169-173 (1978)

Detlef Wotschke: Nondeterminism and Boolean Operations in PDAs. J. Comput. Syst. Sci. 16(3): 456-461 (1978)

John K. Price, Detlef Wotschke: States Can Sometimes Do More Than Stack Symbols in PDA's. ICALP 1978: 353-362

Detlef Wotschke: Degree-Languages: A New Concept of Acceptance. J. Comput. Syst. Sci. 14(2): 187-209 (1977)

Eva-Maria Mückstein Wotschke, Detlef Wotschke, Peter J. Downey: Size, Index, and Context-Sensitivity of Controlled Partition Grammars. Mathematical Systems Theory 11: 47-60 (1977)

Benton L. Leong, Detlef Wotschke: The Influence of Productions on Derivations and Parsing. POPL 1976: 1-11

Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison (Eds.): Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976

Detlef Wotschke: Degree-Languages, Polynomial Time Recognition, and the LBA Problem. STOC 1975: 145-152

Detlef Wotschke: A characterization of boolean closures of families of languages. Automatentheorie und Formale Sprachen 1973: 191-200

Detlef Wotschke: The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages. GI Jahrestagung 1973: 113-121