Campus Event Calendar
Event Entry
New for: D1, D2
What and Who
REGULAR APPROXIMATIONS OF CFLS: A GRAMMATICAL VIEW
Mark-Jan Nederhof
University of Groningen
DFKI-Kolloquium
AG 1, AG 2
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 26 November 97
10:00
-- Not specified --
43.1 - DFKI
Turing Saal
Saarbrücken
Abstract
We show that for each context-free grammar a new grammar can be
constructed that generates a regular language. This language
contains the original context-free language. Our construction
differs from existing methods of approximation (in particular,
the one by Pereira and Wright, 1991) in that the use of a pushdown
automaton is avoided. This allows better insight into how the
generated language is affected. The new method is also more
attractive from a computational viewpoint.
constructed that generates a regular language. This language
contains the original context-free language. Our construction
differs from existing methods of approximation (in particular,
the one by Pereira and Wright, 1991) in that the use of a pushdown
automaton is avoided. This allows better insight into how the
generated language is affected. The new method is also more
attractive from a computational viewpoint.
Contact
--email hidden
passcode not visible
logged in users only
Uwe Brahm, 04/12/2007 12:00 -- Created document.