Stephan Heilbrunner

According to our database, Stephan Heilbrunner authored at least 12 papers between 1979 and 1996.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1996

A Direct Complement Construction for LR(1) Grammars.

Stephan Heilbrunner

Acta Informatica, 1996

1991

An Efficient Recognizer for the Boolean Closure of Context-Free Languages.

Stephan Heilbrunner, Lothar Schmitz

Theor. Comput. Sci., 1991

1987

The Undecidability of the Unification and Matching Problem for Canonical Theories.

Stephan Heilbrunner, Steffen Hölldobler

Acta Informatica, 1987

1985

Truly Prefix-Correct Chain-Free <i> LR </i> (1) Parsers.

Stephan Heilbrunner

Acta Informatica, 1985

1984

For Statements with Restricted Enumerations.

Stephan Heilbrunner, Lothar Schmitz

Proceedings of the International Symposium on Programming, 1984

1983

Formale Sprachbeschreibungen - ist eine Vereinheitlichung in Sicht?

Stephan Heilbrunner, Lutz M. Wegner

Angew. Inform., 1983

A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages.

Stephan Heilbrunner

Theor. Comput. Sci., 1983

Tests for the LR-, LL-, and LC-Regular Conditions.

Stephan Heilbrunner

J. Comput. Syst. Sci., 1983

1982

A Technique for Recursion Removal Based on String Homomorphisms.

Stephan Heilbrunner, Werner Pohlmann

Sci. Comput. Program., 1982

1981

A Parsing Automata Approach to LR Theory.

Stephan Heilbrunner

Theor. Comput. Sci., 1981

1980

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

Stephan Heilbrunner

RAIRO Theor. Informatics Appl., 1980

1979

On the Definition of ELR(k) and ELL(k) Grammars.

Stephan Heilbrunner

Acta Informatica, 1979