| 2008 |
|---|
| 27 | EE | Martin Kutrib,
Andreas Malcher,
Detlef Wotschke:
The Boolean closure of linear context-free languages.
Acta Inf. 45(3): 177-191 (2008) |
| 26 | EE | Remco Loos,
Andreas Malcher,
Detlef Wotschke:
Descriptional Complexity of Splicing Systems.
Int. J. Found. Comput. Sci. 19(4): 813-826 (2008) |
| 2005 |
|---|
| 25 | EE | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
Measuring nondeterminism in pushdown automata.
J. Comput. Syst. Sci. 71(4): 440-466 (2005) |
| 2004 |
|---|
| 24 | EE | Martin Kutrib,
Andreas Malcher,
Detlef Wotschke:
The Boolean Closure of Linear Context-Free Languages.
Developments in Language Theory 2004: 284-295 |
| 2002 |
|---|
| 23 | EE | 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) |
| 2000 |
|---|
| 22 | EE | Hing Leung,
Detlef Wotschke:
On the size of parsers and LR(k)-grammars.
Theor. Comput. Sci. 242(1-2): 59-69 (2000) |
| 1997 |
|---|
| 21 | | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
Measuring Nondeterminism in Pushdown Automata.
STACS 1997: 295-306 |
| 1993 |
|---|
| 20 | | 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) |
| 19 | | 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) |
| 1992 |
|---|
| 18 | | Jonathan Goldstine,
Hing Leung,
Detlef Wotschke:
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Inf. Comput. 100(2): 261-270 (1992) |
| 1990 |
|---|
| 17 | | Jonathan Goldstine,
Chandra M. R. Kintala,
Detlef Wotschke:
On Measuring Nondeterminism in Regular Languages
Inf. Comput. 86(2): 179-194 (1990) |
| 1986 |
|---|
| 16 | | Chandra M. R. Kintala,
Detlef Wotschke:
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract).
STACS 1986: 291-305 |
| 1983 |
|---|
| 15 | | Peter Drum,
Detlef Wotschke:
Economy of Description for Program Schemes -Extended Abstract-.
FCT 1983: 475-486 |
| 1982 |
|---|
| 14 | | Jonathan Goldstine,
John K. Price,
Detlef Wotschke:
On Reducing the Number of States in a PDA.
Mathematical Systems Theory 15(4): 315-321 (1982) |
| 13 | | 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) |
| 1981 |
|---|
| 12 | | Walter Bucher,
Hermann A. Maurer,
Karel Culik II,
Detlef Wotschke:
Concise Description of Finite Languages.
Theor. Comput. Sci. 14: 227-246 (1981) |
| 1980 |
|---|
| 11 | | Chandra M. R. Kintala,
Detlef Wotschke:
Amounts of Nondeterminism in Finite Automata.
Acta Inf. 13: 199-204 (1980) |
| 1979 |
|---|
| 10 | | Seymour Ginsburg,
Benton L. Leong,
Otto Mayer,
Detlef Wotschke:
On Strict Interpretations of Grammar Forms.
Mathematical Systems Theory 12: 233-252 (1979) |
| 1978 |
|---|
| 9 | | John K. Price,
Detlef Wotschke:
States Can Sometimes Do More Than Stack Symbols in PDA's.
ICALP 1978: 353-362 |
| 8 | | Detlef Wotschke,
Celia Wrathall:
A Note on Classes of Complements and the LBA Problem.
Acta Inf. 10: 169-173 (1978) |
| 7 | | Detlef Wotschke:
Nondeterminism and Boolean Operations in PDAs.
J. Comput. Syst. Sci. 16(3): 456-461 (1978) |
| 1977 |
|---|
| 6 | | Detlef Wotschke:
Degree-Languages: A New Concept of Acceptance.
J. Comput. Syst. Sci. 14(2): 187-209 (1977) |
| 5 | | 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) |
| 1976 |
|---|
| 4 | | Benton L. Leong,
Detlef Wotschke:
The Influence of Productions on Derivations and Parsing.
POPL 1976: 1-11 |
| 1975 |
|---|
| 3 | | Detlef Wotschke:
Degree-Languages, Polynomial Time Recognition, and the LBA Problem
STOC 1975: 145-152 |
| 1973 |
|---|
| 2 | | Detlef Wotschke:
A characterization of boolean closures of families of languages.
Automatentheorie und Formale Sprachen 1973: 191-200 |
| 1 | | Detlef Wotschke:
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages.
GI Jahrestagung 1973: 113-121 |
