Stephan Heilbrunner

Publication Activity (10 Years)

Years Active: 1979-1996
Publications (10 Years): 0

Publications

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