Detlef Wotschke

发表

On the Relation between Ambiguity and Nondeterminism in Finite Automata

Jonathan Goldstine, Hing Leung, Detlef Wotschke, 1992, Inf. Comput..

Descriptional Complexity of Machines with Limited Resources

Andreas Malcher, Jonathan Goldstine, Hing Leung, 2002, J. Univers. Comput. Sci..

Concise Description of Finite Languages

Hermann A. Maurer, Karel Culik, Detlef Wotschke, 1981, Theor. Comput. Sci..

Measuring Nondeterminism in Pushdown Automata

Jonathan Goldstine, Hing Leung, Detlef Wotschke, 1997, STACS.

Measuring nondeterminism in pushdown automata

Jonathan Goldstine, Hing Leung, Detlef Wotschke, 2005, J. Comput. Syst. Sci..

Concise representations of regular languages by degree and probabilistic finite automata

Detlef Wotschke, Chandra M. R. Kintala, Kong-Yee Pun, 2005, Mathematical systems theory.

Degree-languages, polynomial time recognition, and the LBA problem

Detlef Wotschke, D. Wotschke, 1975, STOC.

Amounts of nondeterminism in finite automata

Detlef Wotschke, Chandra M. R. Kintala, 1980, Acta Informatica.

The Boolean closure of linear context-free languages

Martin Kutrib, Andreas Malcher, Detlef Wotschke, 2007, Acta Informatica.

States Can Sometimes Do More Than Stack Symbols in PDA's

Detlef Wotschke, John K. Price, 1978, ICALP.

On reducing the number of states in a PDA

Jonathan Goldstine, Detlef Wotschke, John K. Price, 2005, Mathematical systems theory.

The Boolean Closure of Linear Context-Free Languages

Martin Kutrib, Andreas Malcher, Detlef Wotschke, 2004, Developments in Language Theory.

Economy of Description for Program Schemes -Extended Abstract-

Detlef Wotschke, Peter Drum, D. Wotschke, 1983, FCT.

On reducing the number of stack symbols in a PDA

Jonathan Goldstine, Detlef Wotschke, John K. Price, 2005, Mathematical systems theory.

On Measuring Nondeterminism in Regular Languages

Jonathan Goldstine, Detlef Wotschke, Chandra M. R. Kintala, 1990, Inf. Comput..

The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages

Detlef Wotschke, D. Wotschke, 1973, GI Jahrestagung.

On the size of parsers and LR(k)-grammars

Hing Leung, Detlef Wotschke, 2000, Theor. Comput. Sci..

Remembering Chandra Kintala

Andreas Malcher, Detlef Wotschke, Martin Kappes, 2010, DCFS.

Degree-Languages: A New Concept of Acceptance

Detlef Wotschke, D. Wotschke, 1977, J. Comput. Syst. Sci..

Descriptional Complexity of Splicing Systems

Andreas Malcher, Detlef Wotschke, Remco Loos, 2007, Int. J. Found. Comput. Sci..

In Memoriam Chandra Kintala

Andreas Malcher, Detlef Wotschke, Martin Kappes, 2012, Int. J. Found. Comput. Sci..

A note on classes of complements and the LBA problem

Detlef Wotschke, Celia Wrathall, 2004, Acta Informatica.

On strict interpretations of grammar forms

Seymour Ginsburg, Detlef Wotschke, Otto Mayer, 2005, Mathematical systems theory.

Nondeterminism and Boolean Operations in PDAs

Detlef Wotschke, D. Wotschke, 1978, J. Comput. Syst. Sci..

A characterization of boolean closures of families of languages

Detlef Wotschke, D. Wotschke, 1973, Automatentheorie und Formale Sprachen.

The influence of productions on derivations and parsing (Extended Abstract)

Detlef Wotschke, Benton L. Leong, 1976, POPL '76.

A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?

Jonathan Goldstine, Detlef Wotschke, John K. Price, 1982, Theor. Comput. Sci..

Boolean operators on languages.

Detlef Wotschke, 1974 .

Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract)

Detlef Wotschke, Chandra M. R. Kintala, 1986, STACS.

Size, index, and context-sensitivity of controlled partition grammars

Detlef Wotschke, Peter J. Downey, Eva-Maria Mückstein Wotschke, 1977, Mathematical systems theory.

Trends and Applications in Formal Language Theory (Dagstuhl Seminar 9142)

Detlef Wotschke, Jean Berstel, Franz-Josef Brandenburg, 2021 .