Stephan Heilbrunner

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A direct complement construction for \(LR\)(1) grammars Acta Informatica	1995-11-15	Paper
An efficient recognizer for the Boolean closure of context-free languages Theoretical Computer Science	1991-01-01	Paper
The undecidability of the unification and matching problem for canonical theories Acta Informatica	1987-01-01	Paper
Truly prefix-correct chain-free LR(1) parsers Acta Informatica	1985-01-01	Paper
scientific article; zbMATH DE number 3874577 (Why is no real title available?)	1984-01-01	Paper
Tests for the LR-, LL-, and LC-regular conditions Journal of Computer and System Sciences	1983-01-01	Paper
A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages Theoretical Computer Science	1983-01-01	Paper
A technique for recursion removal based on string homomorphisms Science of Computer Programming	1982-01-01	Paper
A parsing automata approach to LR theory Theoretical Computer Science	1981-01-01	Paper
scientific article; zbMATH DE number 3675332 (Why is no real title available?)	1980-01-01	Paper
On the definition of ELR(k) and ELL(k) grammars Acta Informatica	1979-01-01	Paper
scientific article; zbMATH DE number 3560722 (Why is no real title available?)	1975-01-01	Paper

Research outcomes over time

This page was built for person: Stephan Heilbrunner