Detlef Wotschke

40 papers A* 4A 2B 1C 1Journal 23Unranked 4

Year	Rank	Type	Title / Venue / Authors
2012	J	`jnl`	In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. Martin Kappes, Andreas Malcher, Detlef Wotschke
2010	—	`conf`	Remembering Chandra Kintala DCFS Martin Kappes, Andreas Malcher, Detlef Wotschke
2008	J	`jnl`	Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. Remco Loos, Andreas Malcher, Detlef Wotschke
2008	J	`jnl`	The Boolean closure of linear context-free languages. Acta Informatica Martin Kutrib, Andreas Malcher, Detlef Wotschke
2007	—	`conf`	Descriptional Complexity of Splicing Systems. DCFS Remco Loos, Andreas Malcher, Detlef Wotschke
2007	J	`jnl`	Editorial. J. Autom. Lang. Comb. Giovanni Pighizzini, Detlef Wotschke
2005	—	`ed.`	7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings DCFS Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke
2005	J	`jnl`	Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. Jonathan Goldstine, Hing Leung, Detlef Wotschke
2004	—	`ed.`	6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings DCFS Lucian Ilie, Detlef Wotschke
2004	J	`jnl`	Editorial. J. Autom. Lang. Comb. Jürgen Dassow, Helmut Jürgensen, Detlef Wotschke
2004	C	`conf`	The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory Martin Kutrib, Andreas Malcher, Detlef Wotschke
2003	—	`ed.`	5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings DCFS Erzsébet Csuhaj-Varjú, Chandra M. R. Kintala, Detlef Wotschke, György Vaszil
2002	J	`jnl`	Descriptional Complexity of Machines with Limited Resources. J. Univers. Comput. Sci. Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
2002	J	`jnl`	Editorial. J. Autom. Lang. Comb. Jürgen Dassow, Detlef Wotschke, Bernd Reichel
2002	—	`ed.`	Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21 - 24, 2002. Pre-proceedings DCFS Jürgen Dassow, Maia Hoeberechts, Helmut Jürgensen, Detlef Wotschke
2001	—	`ed.`	Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings DCFS Jürgen Dassow, Detlef Wotschke
2000	J	`jnl`	Editorial. J. Autom. Lang. Comb. Jürgen Dassow, Detlef Wotschke
2000	J	`jnl`	On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. Hing Leung, Detlef Wotschke
1997	A	`conf`	Measuring Nondeterminism in Pushdown Automata. STACS Jonathan Goldstine, Hing Leung, Detlef Wotschke
1993	J	`jnl`	Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata. Math. Syst. Theory Chandra M. R. Kintala, Kong-Yee Pun, Detlef Wotschke
1993	J	`jnl`	On Reducing the Number of Stack Symbols in a PDA. Math. Syst. Theory Jonathan Goldstine, John K. Price, Detlef Wotschke
1992	J	`jnl`	On the Relation between Ambiguity and Nondeterminism in Finite Automata Inf. Comput. Jonathan Goldstine, Hing Leung, Detlef Wotschke
1990	J	`jnl`	On Measuring Nondeterminism in Regular Languages Inf. Comput. Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke
1986	A	`conf`	Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). STACS Chandra M. R. Kintala, Detlef Wotschke
1983	B	`conf`	Economy of Description for Program Schemes -Extended Abstract-. FCT Peter Drum, Detlef Wotschke
1982	J	`jnl`	A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? Theor. Comput. Sci. Jonathan Goldstine, John K. Price, Detlef Wotschke
1982	J	`jnl`	On Reducing the Number of States in a PDA. Math. Syst. Theory Jonathan Goldstine, John K. Price, Detlef Wotschke
1981	J	`jnl`	Concise Description of Finite Languages. Theor. Comput. Sci. Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke
1980	J	`jnl`	Amounts of Nondeterminism in Finite Automata. Acta Informatica Chandra M. R. Kintala, Detlef Wotschke
1979	J	`jnl`	On Strict Interpretations of Grammar Forms. Math. Syst. Theory Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke
1978	J	`jnl`	A Note on Classes of Complements and the LBA Problem. Acta Informatica Detlef Wotschke, Celia Wrathall
1978	J	`jnl`	Nondeterminism and Boolean Operations in PDAs. J. Comput. Syst. Sci. Detlef Wotschke
1978	A*	`conf`	States Can Sometimes Do More Than Stack Symbols in PDA's. ICALP John K. Price, Detlef Wotschke
1977	J	`jnl`	Degree-Languages: A New Concept of Acceptance. J. Comput. Syst. Sci. Detlef Wotschke
1977	J	`jnl`	Size, Index, and Context-Sensitivity of Controlled Partition Grammars. Math. Syst. Theory Eva-Maria Mückstein Wotschke, Detlef Wotschke, Peter J. Downey
1976	A*	`ed.`	Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA STOC Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison
1976	A*	`conf`	The Influence of Productions on Derivations and Parsing. POPL Benton L. Leong, Detlef Wotschke
1975	A*	`conf`	Degree-Languages, Polynomial Time Recognition, and the LBA Problem STOC Detlef Wotschke
1973	—	`conf`	A characterization of boolean closures of families of languages. Automatentheorie und Formale Sprachen Detlef Wotschke
1973	—	`conf`	The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages. GI Jahrestagung Detlef Wotschke