Detail výsledku
Bidirectional Contextual Grammars
The present paper introduces and discusses bidirectional contextualgrammars as a straightforward generalization of externally generatingcontextual grammars without choice. In essence, besides ordinaryderivation steps, the bidirectional contextual grammars can also makereduction steps, which shorten the rewritten strings. This paperdemonstrates that these grammars characterize the family of recursivelyenumerable languages. In fact, this characterization holds even interms of one-turn bidirectional contextual grammars, which can changederivations steps to reduction steps during the generation process nomore than once.
contextual grammars, bidirectional grammars, generative power, recursively enumerable languages
@inproceedings{BUT192594,
author="Jiří {Techet}",
title="Bidirectional Contextual Grammars",
booktitle="Proceedings of the 12th Conference and Competition STUDENT EEICT 2006 Volume 4",
year="2006",
pages="405--409",
publisher="Faculty of Information Technology BUT",
address="Brno",
isbn="80-214-3163-6"
}