The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Detlef Wotschke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Detlef Wotschke
    A characterization of boolean closures of families of languages. [Citation Graph (0, 0)][DBLP]
    Automatentheorie und Formale Sprachen, 1973, pp:191-200 [Conf]
  2. Martin Kutrib, Andreas Malcher, Detlef Wotschke
    The Boolean Closure of Linear Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:284-295 [Conf]
  3. Peter Drum, Detlef Wotschke
    Economy of Description for Program Schemes -Extended Abstract-. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:475-486 [Conf]
  4. Detlef Wotschke
    The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1973, pp:113-121 [Conf]
  5. John K. Price, Detlef Wotschke
    States Can Sometimes Do More Than Stack Symbols in PDA's. [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:353-362 [Conf]
  6. Benton L. Leong, Detlef Wotschke
    The Influence of Productions on Derivations and Parsing. [Citation Graph (0, 0)][DBLP]
    POPL, 1976, pp:1-11 [Conf]
  7. Jonathan Goldstine, Hing Leung, Detlef Wotschke
    Measuring Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:295-306 [Conf]
  8. Chandra M. R. Kintala, Detlef Wotschke
    Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:291-305 [Conf]
  9. Detlef Wotschke
    Degree-Languages, Polynomial Time Recognition, and the LBA Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:145-152 [Conf]
  10. Chandra M. R. Kintala, Detlef Wotschke
    Amounts of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1980, v:13, n:, pp:199-204 [Journal]
  11. Detlef Wotschke, Celia Wrathall
    A Note on Classes of Complements and the LBA Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1978, v:10, n:, pp:169-173 [Journal]
  12. Jonathan Goldstine, Chandra M. R. Kintala, Detlef Wotschke
    On Measuring Nondeterminism in Regular Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:2, pp:179-194 [Journal]
  13. Jonathan Goldstine, Hing Leung, Detlef Wotschke
    On the Relation between Ambiguity and Nondeterminism in Finite Automata [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:100, n:2, pp:261-270 [Journal]
  14. Jonathan Goldstine, Hing Leung, Detlef Wotschke
    Measuring nondeterminism in pushdown automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:440-466 [Journal]
  15. Detlef Wotschke
    Degree-Languages: A New Concept of Acceptance. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1977, v:14, n:2, pp:187-209 [Journal]
  16. Detlef Wotschke
    Nondeterminism and Boolean Operations in PDAs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:3, pp:456-461 [Journal]
  17. Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke
    Descriptional Complexity of Machines with Limited Resources. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:193-234 [Journal]
  18. Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke
    On Strict Interpretations of Grammar Forms. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1979, v:12, n:, pp:233-252 [Journal]
  19. Jonathan Goldstine, John K. Price, Detlef Wotschke
    On Reducing the Number of States in a PDA. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1982, v:15, n:4, pp:315-321 [Journal]
  20. Jonathan Goldstine, John K. Price, Detlef Wotschke
    On Reducing the Number of Stack Symbols in a PDA. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:4, pp:313-326 [Journal]
  21. Chandra M. R. Kintala, Kong-Yee Pun, Detlef Wotschke
    Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:4, pp:379-395 [Journal]
  22. Eva-Maria Mückstein Wotschke, Detlef Wotschke, Peter J. Downey
    Size, Index, and Context-Sensitivity of Controlled Partition Grammars. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:11, n:, pp:47-60 [Journal]
  23. Walter Bucher, Hermann A. Maurer, Karel Culik II, Detlef Wotschke
    Concise Description of Finite Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:14, n:, pp:227-246 [Journal]
  24. Jonathan Goldstine, John K. Price, Detlef Wotschke
    A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:33-40 [Journal]
  25. Hing Leung, Detlef Wotschke
    On the size of parsers and LR(k)-grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:59-69 [Journal]

  26. The Boolean closure of linear context-free languages. [Citation Graph (, )][DBLP]


  27. Remembering Chandra Kintala [Citation Graph (, )][DBLP]


Search in 0.061secs, Finished in 0.063secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002