Dyck-based characterizations of Indexed Languages
Formal Languages and Automata Theory
2015-11-11 v4
Abstract
Indexed languages are a generalization of context-free languages and form a proper subset of context-sensitive languages. We propose to generalize to indexed languages several well known characterizations of context-free languages: namely, the characterization by rational transductions defined by Nivat, the Chomsky-Sch\"utzenberger theorem, and the logical characterization proved by Lautemann et al.
Cite
@article{arxiv.1409.6112,
title = {Dyck-based characterizations of Indexed Languages},
author = {Severine Fratani and El Makki Voundy},
journal= {arXiv preprint arXiv:1409.6112},
year = {2015}
}
Comments
The general approach can be improved and some statements are inaccurate