Stephan Heilbrunner

12 papers Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
1996 J jnl
A Direct Complement Construction for LR(1) Grammars.
Acta Informatica
Stephan Heilbrunner
1991 J jnl
An Efficient Recognizer for the Boolean Closure of Context-Free Languages.
Theor. Comput. Sci.
Stephan Heilbrunner, Lothar Schmitz
1987 J jnl
The Undecidability of the Unification and Matching Problem for Canonical Theories.
Acta Informatica
Stephan Heilbrunner, Steffen Hölldobler
1985 J jnl
Truly Prefix-Correct Chain-Free
Acta Informatica
Stephan Heilbrunner
1984 — conf
For Statements with Restricted Enumerations.
Symposium on Programming
Stephan Heilbrunner, Lothar Schmitz
1983 J jnl
A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages.
Theor. Comput. Sci.
Stephan Heilbrunner
1983 J jnl
Formale Sprachbeschreibungen - ist eine Vereinheitlichung in Sicht?
Angew. Inform.
Stephan Heilbrunner, Lutz M. Wegner
1983 J jnl
Tests for the LR-, LL-, and LC-Regular Conditions.
J. Comput. Syst. Sci.
Stephan Heilbrunner
1982 J jnl
A Technique for Recursion Removal Based on String Homomorphisms.
Sci. Comput. Program.
Stephan Heilbrunner, Werner Pohlmann
1981 J jnl
A Parsing Automata Approach to LR Theory.
Theor. Comput. Sci.
Stephan Heilbrunner
1980 J jnl
An Algorithm for the Solution of Fixed-Point Equations for Infinite Words.
RAIRO Theor. Informatics Appl.
Stephan Heilbrunner
1979 J jnl
On the Definition of ELR(k) and ELL(k) Grammars.
Acta Informatica
Stephan Heilbrunner