Stephan Heilbrunner

According to our database1, Stephan Heilbrunner
  • authored at least 12 papers between 1979 and 1996.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1996
A Direct Complement Construction for LR(1) Grammars.
Acta Inf., 1996

1991
An Efficient Recognizer for the Boolean Closure of Context-Free Languages.
Theor. Comput. Sci., 1991

1987
The Undecidability of the Unification and Matching Problem for Canonical Theories.
Acta Inf., 1987

1985
Truly Prefix-Correct Chain-Free LR (1) Parsers.
Acta Inf., 1985

1984
For Statements with Restricted Enumerations.
Proceedings of the International Symposium on Programming, 1984

1983
Formale Sprachbeschreibungen - ist eine Vereinheitlichung in Sicht?
Angewandte Informatik, 1983

A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages.
Theor. Comput. Sci., 1983

Tests for the LR-, LL-, and LC-Regular Conditions.
J. Comput. Syst. Sci., 1983

1982
A Technique for Recursion Removal Based on String Homomorphisms.
Sci. Comput. Program., 1982

1981
A Parsing Automata Approach to LR Theory.
Theor. Comput. Sci., 1981

1980
An Algorithm for the Solution of Fixed-Point Equations for Infinite Words.
ITA, 1980

1979
On the Definition of ELR(k) and ELL(k) Grammars.
Acta Inf., 1979


  Loading...