A short proof that $O_2$ is an MCFL
Formal Languages and Automata Theory
2016-03-14 v1 Computation and Language
Abstract
We present a new proof that is a multiple context-free language. It contrasts with a recent proof by Salvati (2015) in its avoidance of concepts that seem specific to two-dimensional geometry, such as the complex exponential function. Our simple proof creates realistic prospects of widening the results to higher dimensions. This finding is of central importance to the relation between extreme free word order and classes of grammars used to describe the syntax of natural language.
Cite
@article{arxiv.1603.03610,
title = {A short proof that $O_2$ is an MCFL},
author = {Mark-Jan Nederhof},
journal= {arXiv preprint arXiv:1603.03610},
year = {2016}
}
Comments
9 pages