Mappings which Preserve Context Sensitive Languages
暂无分享,去创建一个
A basic result which gives a condition under which a (possibly length-decreasing) homomorphism preserves a contest. sensitive language is presented. Using this result, conditions under which pushdown transducers and linear bounded transducers preserve contest sensitive languages are given. The basic result is also applied to show that certain rewriting systems generate context sensitive languages instead of arbitrary recursively enumerable sets. Of special interest is the result that if each rule in a rewriting system has a terminal letter on its right side, then the language generated is context free.
[1] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.
[2] Noam Chomsky,et al. On Certain Formal Properties of Grammars , 1959, Inf. Control..
[3] Peter S. Landweber,et al. Three Theorems on Phrase Structure Grammars of Type 1 , 1963, Inf. Control..
[4] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..
[5] Seymour Ginsburg,et al. Preservation of Languages by Transducers , 1966, Inf. Control..