Detlef Wotschke

Goethe University Frankfurt — Germany

Computer Science · Physical Sciences

12h-index565citations39works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(32), Algorithms and Data Compression(12), Machine Learning and Algorithms(11), Computability, Logic, AI Algorithms(10), Formal Methods in Verification(7)

Publications39 total

Descriptional Complexity of Machines with Limited Resources
TUGraz OPEN Library (Graz University of Technology)·2020· 32 citedOpen Access
IN MEMORIAM CHANDRA KINTALA
International Journal of Foundations of Computer Science·2012
Remembering Chandra Kintala
Scientific Publication Server (Frankfurt University of Applied Sciences)·2010Open Access
Remembering Chandra Kintala
Electronic Proceedings in Theoretical Computer Science·2010Open Access
DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
International Journal of Foundations of Computer Science·2008· 10 cited
The Boolean closure of linear context-free languages
Acta Informatica·2008· 12 cited
Descriptional Complexity of Splicing Systems.
DCFS·2007
A characterization of boolean closures of families of languages
Lecture notes in computer science·2006· 6 cited
Measuring nondeterminism in pushdown automata
Journal of Computer and System Sciences·2005· 20 cited
The Boolean Closure of Linear Context-Free Languages
Lecture notes in computer science·2004· 2 cited
Descriptional complexity of formal systems. 5th international workshop. Budapest, 2003. Proceedings
2003
Descriptional Complexity of Machines with Limited Resources.
Zenodo (CERN European Organization for Nuclear Research)·2002· 99 citedOpen Access
On the size of parsers and LR(k)-grammars
Theoretical Computer Science·2000· 10 cited
Measuring nondeterminism in pushdown automata
Lecture notes in computer science·1997· 3 cited
On reducing the number of stack symbols in a PDA
Theory of Computing Systems·1993· 10 cited
Concise representations of regular languages by degree and probabilistic finite automata
Theory of Computing Systems·1993· 9 cited
Descriptional Complexity (Dagstuhl Seminar 9318)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·1993Open Access
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation·1992· 41 cited
Trends and Applications in Formal Language Theory (Dagstuhl Seminar 9142)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·1992Open Access
On measuring nondeterminism in regular languages
Information and Computation·1990· 74 cited
page 1 of 2Next →

Frequent Co-authors

Jonathan Goldstine(9), Andreas Malcher(9), Chandra M. R. Kintala(7), Hing Leung(6), Martin Kappes(5), John K. Price(4), Martin Kutrib(2), Benton Leong(2), Remco Loos(2), Peter Trum(2), Ashok K. Chandra(1), Emily P. Friedman(1), Michael A. Harrison(1), W. Bucher(1), Hermann Maurer(1), Karel Čulík(1), Seymour Ginsburg(1), Otto Mayer(1), Kong -Yee Pun(1), Celia Wrathall(1)