Detlef Wotschke

According to our database1, Detlef Wotschke
  • authored at least 30 papers between 1973 and 2012.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2012
In Memoriam Chandra Kintala.
Int. J. Found. Comput. Sci., 2012

2010
Remembering Chandra Kintala
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

2008
Descriptional Complexity of Splicing Systems.
Int. J. Found. Comput. Sci., 2008

The Boolean closure of linear context-free languages.
Acta Inf., 2008

2007
Descriptional Complexity of Splicing Systems.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

2005
Measuring nondeterminism in pushdown automata.
J. Comput. Syst. Sci., 2005

2004
The Boolean Closure of Linear Context-Free Languages.
Proceedings of the Developments in Language Theory, 2004

2002
Descriptional Complexity of Machines with Limited Resources.
J. UCS, 2002

2000
On the size of parsers and LR(k)-grammars.
Theor. Comput. Sci., 2000

1997
Measuring Nondeterminism in Pushdown Automata.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1993
Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata.
Mathematical Systems Theory, 1993

On Reducing the Number of Stack Symbols in a PDA.
Mathematical Systems Theory, 1993

1992
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Inf. Comput., October, 1992

1990
On Measuring Nondeterminism in Regular Languages
Inf. Comput., June, 1990

1986
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract).
Proceedings of the STACS 86, 1986

1983
Economy of Description for Program Schemes -Extended Abstract-.
Proceedings of the Fundamentals of Computation Theory, 1983

1982
A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?
Theor. Comput. Sci., 1982

On Reducing the Number of States in a PDA.
Mathematical Systems Theory, 1982

1981
Concise Description of Finite Languages.
Theor. Comput. Sci., 1981

1980
Amounts of Nondeterminism in Finite Automata.
Acta Inf., 1980

1979
On Strict Interpretations of Grammar Forms.
Mathematical Systems Theory, 1979

1978
Nondeterminism and Boolean Operations in PDAs.
J. Comput. Syst. Sci., 1978

A Note on Classes of Complements and the LBA Problem.
Acta Inf., 1978

States Can Sometimes Do More Than Stack Symbols in PDA's.
Proceedings of the Automata, 1978

1977
Size, Index, and Context-Sensitivity of Controlled Partition Grammars.
Mathematical Systems Theory, 1977

Degree-Languages: A New Concept of Acceptance.
J. Comput. Syst. Sci., 1977

1976
The Influence of Productions on Derivations and Parsing.
Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

1975
Degree-Languages, Polynomial Time Recognition, and the LBA Problem
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1973
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages.
Proceedings of the Gesellschaft für Informatik e.V., 1973

A characterization of boolean closures of families of languages.
Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973


  Loading...