@inproceedings{nederhof-1997-regular,
title = "Regular Approximations of {CFL}s: A Grammatical View",
author = "Nederhof, Mark-Jan",
booktitle = "Proceedings of the Fifth International Workshop on Parsing Technologies",
month = sep # " 17-20",
year = "1997",
address = "Boston/Cambridge, Massachusetts, USA",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/1997.iwpt-1.19",
pages = "159--170",
abstract = "We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from existing methods of approximation in that 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.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="nederhof-1997-regular">
<titleInfo>
<title>Regular Approximations of CFLs: A Grammatical View</title>
</titleInfo>
<name type="personal">
<namePart type="given">Mark-Jan</namePart>
<namePart type="family">Nederhof</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>1997-sep" 17-20"</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Fifth International Workshop on Parsing Technologies</title>
</titleInfo>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Boston/Cambridge, Massachusetts, USA</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<abstract>We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from existing methods of approximation in that 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.</abstract>
<identifier type="citekey">nederhof-1997-regular</identifier>
<location>
<url>https://aclanthology.org/1997.iwpt-1.19</url>
</location>
<part>
<date>1997-sep" 17-20"</date>
<extent unit="page">
<start>159</start>
<end>170</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Regular Approximations of CFLs: A Grammatical View
%A Nederhof, Mark-Jan
%S Proceedings of the Fifth International Workshop on Parsing Technologies
%D 1997
%8 sep" 17 20"
%I Association for Computational Linguistics
%C Boston/Cambridge, Massachusetts, USA
%F nederhof-1997-regular
%X We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from existing methods of approximation in that 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.
%U https://aclanthology.org/1997.iwpt-1.19
%P 159-170
Markdown (Informal)
[Regular Approximations of CFLs: A Grammatical View](https://aclanthology.org/1997.iwpt-1.19) (Nederhof, IWPT 1997)
ACL