Stephan Heilbrunner

Available identifiers

zbMath Open heilbrunner.stephanMaRDI QIDQ802878

List of research outcomes

Publication	Date of Publication	Type
A direct complement construction for \(LR\)(1) grammars	1995-11-15	Paper
An efficient recognizer for the Boolean closure of context-free languages	1991-01-01	Paper
The undecidability of the unification and matching problem for canonical theories	1987-01-01	Paper
Truly prefix-correct chain-free LR(1) parsers	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3340115	1984-01-01	Paper
Tests for the LR-, LL-, and LC-regular conditions	1983-01-01	Paper
A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages	1983-01-01	Paper
A technique for recursion removal based on string homomorphisms	1982-01-01	Paper
A parsing automata approach to LR theory	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3871942	1980-01-01	Paper
On the definition of ELR(k) and ELL(k) grammars	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4131635	1975-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Stephan Heilbrunner