default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDetlef Wotschke
Person information
- affiliation: Goethe University of Frankfurt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j23]Martin Kappes, Andreas Malcher, Detlef Wotschke:
In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. 23(1): 5-19 (2012)- 2010
- [c11]Martin Kappes, Andreas Malcher, Detlef Wotschke:
Remembering Chandra Kintala. DCFS 2010: 15-26
2000 – 2009
- 2008
- [j22]Martin Kutrib
, Andreas Malcher, Detlef Wotschke:
The Boolean closure of linear context-free languages. Acta Informatica 45(3): 177-191 (2008) - [j21]Remco Loos, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. 19(4): 813-826 (2008) - 2007
- [j20]Giovanni Pighizzini, Detlef Wotschke:
Editorial. J. Autom. Lang. Comb. 12(1-2): 5 (2007) - [c10]Remco Loos, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Splicing Systems. DCFS 2007: 93-104 - 2005
- [j19]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring nondeterminism in pushdown automata. J. Comput. Syst. Sci. 71(4): 440-466 (2005) - [e6]Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke:
7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings. Università degli Studi di Milano, Milan, Italy 2005 [contents] - 2004
- [j18]Jürgen Dassow, Helmut Jürgensen, Detlef Wotschke:
Editorial. J. Autom. Lang. Comb. 9(2/3): 173 (2004) - [c9]Martin Kutrib, Andreas Malcher, Detlef Wotschke:
The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory 2004: 284-295 - [e5]Lucian Ilie, Detlef Wotschke:
6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26 - 28, 2004. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2004, ISBN 0-7714-2506-6 [contents] - 2003
- [e4]Erzsébet Csuhaj-Varjú, Chandra M. R. Kintala, Detlef Wotschke, György Vaszil:
5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary 2003, ISBN 963-311-356-3 [contents] - 2002
- [j17]Jürgen Dassow, Detlef Wotschke, Bernd Reichel:
Editorial. J. Autom. Lang. Comb. 7(4): 417 (2002) - [j16]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): 193-234 (2002) - [e3]Jürgen Dassow, Maia Hoeberechts, Helmut Jürgensen, Detlef Wotschke:
Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21 - 24, 2002. Pre-proceedings. Department of Computer Science, The University of Western Ontario, Canada 2002, ISBN 0-7714-2388-8 [contents] - 2001
- [e2]Jürgen Dassow, Detlef Wotschke:
Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20 - 22, 2001. Preproceedings. Fakultät für Informatik, Universität Magdeburg, Magdeburg, Germany 2001 [contents] - 2000
- [j15]Jürgen Dassow, Detlef Wotschke:
Editorial. J. Autom. Lang. Comb. 5(3): 173 (2000) - [j14]Hing Leung, Detlef Wotschke:
On the size of parsers and LR(k)-grammars. Theor. Comput. Sci. 242(1-2): 59-69 (2000)
1990 – 1999
- 1997
- [c8]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
Measuring Nondeterminism in Pushdown Automata. STACS 1997: 295-306 - 1993
- [j13]Jonathan Goldstine, John K. Price, Detlef Wotschke:
On Reducing the Number of Stack Symbols in a PDA. Math. Syst. Theory 26(4): 313-326 (1993) - [j12]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): 379-395 (1993) - 1992
- [j11]Jonathan Goldstine, Hing Leung, Detlef Wotschke:
On the Relation between Ambiguity and Nondeterminism in Finite Automata. Inf. Comput. 100(2): 261-270 (1992) - 1990
- [j10]Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke:
On Measuring Nondeterminism in Regular Languages. Inf. Comput. 86(2): 179-194 (1990)
1980 – 1989
- 1986
- [c7]Chandra M. R. Kintala, Detlef Wotschke:
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). STACS 1986: 291-305 - 1983
- [c6]Peter Drum, Detlef Wotschke:
Economy of Description for Program Schemes -Extended Abstract-. FCT 1983: 475-486 - 1982
- [j9]Jonathan Goldstine, John K. Price, Detlef Wotschke:
On Reducing the Number of States in a PDA. Math. Syst. Theory 15(4): 315-321 (1982) - [j8]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
- [j7]Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke:
Concise Description of Finite Languages. Theor. Comput. Sci. 14: 227-246 (1981) - 1980
- [j6]Chandra M. R. Kintala, Detlef Wotschke:
Amounts of Nondeterminism in Finite Automata. Acta Informatica 13: 199-204 (1980)
1970 – 1979
- 1979
- [j5]Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke:
On Strict Interpretations of Grammar Forms. Math. Syst. Theory 12: 233-252 (1979) - 1978
- [j4]Detlef Wotschke, Celia Wrathall:
A Note on Classes of Complements and the LBA Problem. Acta Informatica 10: 169-173 (1978) - [j3]Detlef Wotschke:
Nondeterminism and Boolean Operations in PDAs. J. Comput. Syst. Sci. 16(3): 456-461 (1978) - [c5]John K. Price, Detlef Wotschke:
States Can Sometimes Do More Than Stack Symbols in PDA's. ICALP 1978: 353-362 - 1977
- [j2]Detlef Wotschke:
Degree-Languages: A New Concept of Acceptance. J. Comput. Syst. Sci. 14(2): 187-209 (1977) - [j1]Eva-Maria Mückstein Wotschke, Detlef Wotschke, Peter J. Downey:
Size, Index, and Context-Sensitivity of Controlled Partition Grammars. Math. Syst. Theory 11: 47-60 (1977) - 1976
- [c4]Benton L. Leong, Detlef Wotschke:
The Influence of Productions on Derivations and Parsing. POPL 1976: 1-11 - [e1]Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison:
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976 [contents] - 1975
- [c3]Detlef Wotschke:
Degree-Languages, Polynomial Time Recognition, and the LBA Problem. STOC 1975: 145-152 - 1973
- [c2]Detlef Wotschke:
A characterization of boolean closures of families of languages. Automatentheorie und Formale Sprachen 1973: 191-200 - [c1]Detlef Wotschke:
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages. GI Jahrestagung 1973: 113-121
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
