Showing papers by "Rani Siromoney published in 1971"
TL;DR: A one-to-one correspondence is established between the class of all equal matrix languages and theclass of finite-turn checking automata, which is provided with a counter in its memory to keep track of the number of turns of the stack-head.
28 citations
01 Oct 1971
TL;DR: It is shown that theFamily of equal matrix languages (EML) which intersects the family of context-sensitive and context-free languages is not closed under Kleene closure, intersection and complementation.
Abstract: It is shown that the family of equal matrix languages (EML) which intersects the family of context-sensitive and context-free languages is not closed under Kleene closure, intersection and complementation. The family of bounded EML whose generative power lies between that of bounded context-sensitive languages and bounded context-free languages is shown to be a class of unambiguous languages. Operations that preserve unambiguity and certain decidability questions are discussed.
4 citations