Detlef Wotschke

Publication Activity (10 Years)

Years Active: 1973-2012
Publications (10 Years): 0

Publications

Martin Kappes, Andreas Malcher, Detlef Wotschke
In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. 23 (1) (2012)
Martin Kappes, Andreas Malcher, Detlef Wotschke
Remembering Chandra Kintala DCFS (2010)
Martin Kutrib, Andreas Malcher, Detlef Wotschke
The Boolean closure of linear context-free languages. Acta Informatica 45 (3) (2008)
Remco Loos, Andreas Malcher, Detlef Wotschke
Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. 19 (4) (2008)
Giovanni Pighizzini, Detlef Wotschke
Editorial. J. Autom. Lang. Comb. 12 (1-2) (2007)
Remco Loos, Andreas Malcher, Detlef Wotschke
Descriptional Complexity of Splicing Systems. DCFS (2007)
Jonathan Goldstine, Hing Leung, Detlef Wotschke
Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71 (4) (2005)
Martin Kutrib, Andreas Malcher, Detlef Wotschke
The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory (2004)
Jürgen Dassow, Helmut Jürgensen, Detlef Wotschke
Editorial. J. Autom. Lang. Comb. 9 (2/3) (2004)
Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
Descriptional Complexity of Machines with Limited Resources. J. Univers. Comput. Sci. 8 (2) (2002)
Jürgen Dassow, Detlef Wotschke, Bernd Reichel
Editorial. J. Autom. Lang. Comb. 7 (4) (2002)
Hing Leung, Detlef Wotschke
On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. 242 (1-2) (2000)
Jürgen Dassow, Detlef Wotschke
Editorial. J. Autom. Lang. Comb. 5 (3) (2000)
Jonathan Goldstine, Hing Leung, Detlef Wotschke
Measuring Nondeterminism in Pushdown Automata. STACS (1997)
Jonathan Goldstine, John K. Price, Detlef Wotschke
On Reducing the Number of Stack Symbols in a PDA. Math. Syst. Theory 26 (4) (1993)
Chandra M. R. Kintala, Kong-Yee Pun, Detlef Wotschke
Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata. Math. Syst. Theory 26 (4) (1993)
Jonathan Goldstine, Hing Leung, Detlef Wotschke
On the Relation between Ambiguity and Nondeterminism in Finite Automata Inf. Comput. 100 (2) (1992)
Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke
On Measuring Nondeterminism in Regular Languages Inf. Comput. 86 (2) (1990)
Chandra M. R. Kintala, Detlef Wotschke
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). STACS (1986)
Peter Drum, Detlef Wotschke
Economy of Description for Program Schemes -Extended Abstract-. FCT (1983)
Jonathan Goldstine, John K. Price, Detlef Wotschke
On Reducing the Number of States in a PDA. Math. Syst. Theory 15 (4) (1982)
Jonathan Goldstine, John K. Price, Detlef Wotschke
A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? Theor. Comput. Sci. 18 (1982)
Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke
Concise Description of Finite Languages. Theor. Comput. Sci. 14 (1981)
Chandra M. R. Kintala, Detlef Wotschke
Amounts of Nondeterminism in Finite Automata. Acta Informatica 13 (1980)
Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke
On Strict Interpretations of Grammar Forms. Math. Syst. Theory 12 (1979)
Detlef Wotschke
Nondeterminism and Boolean Operations in PDAs. J. Comput. Syst. Sci. 16 (3) (1978)
Detlef Wotschke, Celia Wrathall
A Note on Classes of Complements and the LBA Problem. Acta Informatica 10 (1978)
John K. Price, Detlef Wotschke
States Can Sometimes Do More Than Stack Symbols in PDA's. ICALP (1978)
Detlef Wotschke
Degree-Languages: A New Concept of Acceptance. J. Comput. Syst. Sci. 14 (2) (1977)
Eva-Maria Mückstein Wotschke, Detlef Wotschke, Peter J. Downey
Size, Index, and Context-Sensitivity of Controlled Partition Grammars. Math. Syst. Theory 11 (1977)
Benton L. Leong, Detlef Wotschke
The Influence of Productions on Derivations and Parsing. POPL (1976)
Detlef Wotschke
Degree-Languages, Polynomial Time Recognition, and the LBA Problem STOC (1975)
Detlef Wotschke
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages. GI Jahrestagung (1973)
Detlef Wotschke
A characterization of boolean closures of families of languages. Automatentheorie und Formale Sprachen (1973)