- CSB - MetaPress - Google - Bing - Yahoo
 | 1996 | |
|---|---|---|
| j11 |      | Stephan Heilbrunner: A Direct Complement Construction for LR(1) Grammars. Acta Inf. 33(8): 781-797 (1996) |
| 1991 | ||
| j10 | | Stephan Heilbrunner, Lothar Schmitz: An Efficient Recognizer for the Boolean Closure of Context-Free Languages. Theor. Comput. Sci. 80(1): 53-75 (1991) |
| 1987 | ||
| j9 | | Stephan Heilbrunner, Steffen Hölldobler: The Undecidability of the Unification and Matching Problem for Canonical Theories. Acta Inf. 24(2): 157-171 (1987) |
| 1985 | ||
| j8 | | Stephan Heilbrunner: Truly Prefix-Correct Chain-Free LR (1) Parsers. Acta Inf. 22(5): 499-536 (1985) |
| 1984 | ||
| c1 | | Stephan Heilbrunner, Lothar Schmitz: For Statements with Restricted Enumerations. Symposium on Programming 1984: 145-154 |
| 1983 | ||
| j7 | | Stephan Heilbrunner: Tests for the LR-, LL-, and LC-Regular Conditions. J. Comput. Syst. Sci. 27(1): 1-13 (1983) |
| j6 | | Stephan Heilbrunner: A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages. Theor. Comput. Sci. 23: 49-68 (1983) |
| j5 |  | Stephan Heilbrunner, Lutz Michael Wegner: Formale Sprachbeschreibungen - ist eine Vereinheitlichung in Sicht? Angewandte Informatik 25(3): 93-98 (1983) |
| 1982 | ||
| j4 | | Stephan Heilbrunner, Werner Pohlmann: A Technique for Recursion Removal Based on String Homomorphisms. Sci. Comput. Program. 2(1): 69-81 (1982) |
| 1981 | ||
| j3 | | Stephan Heilbrunner: A Parsing Automata Approach to LR Theory. Theor. Comput. Sci. 15: 117-157 (1981) |
| 1980 | ||
| j2 | | Stephan Heilbrunner: An Algorithm for the Solution of Fixed-Point Equations for Infinite Words. ITA 14(2): 131-141 (1980) |
| 1979 | ||
| j1 | | |
| 1 | Steffen Hölldobler | |
| 2 | Werner Pohlmann | |
| 3 | Lothar Schmitz | |
| 4 | Lutz Michael Wegner |
Data released under the ODC-BY 1.0 license — See also our legal information page