Abstract
A subfamily LFT of the family CS of context-sensitive languages is investigated. Elements of LFT are called left transformation languages. Any context-sensitive language is represented in the form h(Li OLf) where Li, Z^eLFT, h is a length-preserv ing homomorphism, and I/f is the mirror image of Z/ 2. This fact implies that the LBAproblem is equivalent to the problem whether LFT can be accepted by deterministic linear bounded automata. It is remarkable that LFT is an intersection-closed AFL and the emptiness problem for LFT is effectively solvable. Also LFT is shown to have the quasi-prefix property, and we can see that LFT and the family CF of context-free languages are incomparable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Publications of the Research Institute for Mathematical Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
