<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="nederhof-vogler-2019-regular">
    <titleInfo>
        <title>Regular transductions with MCFG input syntax</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>
    <name type="personal">
        <namePart type="given">Heiko</namePart>
        <namePart type="family">Vogler</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2019-09</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Heiko</namePart>
            <namePart type="family">Vogler</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Andreas</namePart>
            <namePart type="family">Maletti</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Dresden, Germany</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars. We prove that synchronous multiple context-free grammars are strictly more powerful than this combination of regular transductions and multiple context-free grammars.</abstract>
    <identifier type="citekey">nederhof-vogler-2019-regular</identifier>
    <identifier type="doi">10.18653/v1/W19-3109</identifier>
    <location>
        <url>https://aclanthology.org/W19-3109</url>
    </location>
    <part>
        <date>2019-09</date>
        <extent unit="page">
            <start>56</start>
            <end>64</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Regular transductions with MCFG input syntax
%A Nederhof, Mark-Jan
%A Vogler, Heiko
%Y Vogler, Heiko
%Y Maletti, Andreas
%S Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing
%D 2019
%8 September
%I Association for Computational Linguistics
%C Dresden, Germany
%F nederhof-vogler-2019-regular
%X We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars. We prove that synchronous multiple context-free grammars are strictly more powerful than this combination of regular transductions and multiple context-free grammars.
%R 10.18653/v1/W19-3109
%U https://aclanthology.org/W19-3109
%U https://doi.org/10.18653/v1/W19-3109
%P 56-64

Markdown (Informal)

[Regular transductions with MCFG input syntax](https://aclanthology.org/W19-3109) (Nederhof & Vogler, FSMNLP 2019)

• Regular transductions with MCFG input syntax (Nederhof & Vogler, FSMNLP 2019)

ACL

• Mark-Jan Nederhof and Heiko Vogler. 2019. Regular transductions with MCFG input syntax. In Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, pages 56–64, Dresden, Germany. Association for Computational Linguistics.