Abstract
A correspondence is established between N 2 , the class of sets of pairs of tapes defined by nondeterministic 2-tape finite automata, and L , the class of linear context-free languages. A second correspondence, which is one-one, between N 2 and a subclass of L is found. This subclass of L is then characterized by expressions quite similar to regular expressions. It is indicated how to develop analogous characterizations for other subclasses of L . A large portion of this paper appears in the author's doctoral thesis which was presented to the Division of Engineering and Applied Physics, Harvard University. The thesis research was under the supervision of Professor Patrick C. Fischer.
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 callDisclaimer: 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.
