Abstract
One-state deterministic top-down transducers (or tree homomorphisms) cannot handle ''prime copying'', i.e. their class of output (string) languages is not closed under the operation L ( -> { (w)^f(n) | w in L, f(n) >= 1 } ) , where f is any integer function whose range contains numbers with arbitrary large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or restricted parallel level) languages, to the syntax-directed translation of context-free languages and to the tree transducer hierarchy.
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 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.
