Abstract
Algebraic and grammatical characterizations of several classes of two-way sequential transductions of languages in a full semiAFL are presented. The algebraic characterizations are in terms of “generalized” replications involving homomorphisms and finite substitutions. The grammars are simple and are of the form found in parallel rewriting systems.
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.
