Abstract
In Theorem 3.2 of my paper [1] it is shown thatDB-FST ⊂ DTR-FST, whereDB-FST is the class of deterministic bottom-up finite state tree transformations and DTR-FST is the class of deterministic top-down finite state tree transformations with regular look-ahead (and ⊂ denotes proper inclusion). One may then ask for a characterization of DB-FST in terms of dtr-fst. In Theorem 3.2 of [1] it is wrongly stated that DB-FST = ODTR-FST, whereODTR-FST is the class of one-state dtr-fst. The correct statement is that DB-FST = FTA ◦ ODTR-FST,
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.
