Top-down tree transducers with regular look-ahead-Reference-Cited by-同舟云学术

Top-down tree transducers with regular look-ahead

Published:1976-12 Issue:1 Volume:10 Page:289-303
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Engelfriet Joost

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01683280.pdf

Reference16 articles.

1. A. Arnold andM. Dauchet, Transductions de forets regulieres monadiques; forets coregulieres,RAIRO 10 (1976), 5–28.

2. P. R. J. Asveld, Controlled iteration grammars and full hyper-AFL's,Memoradum 114, Technical University Twente, Holland, 1976.

3. B. S. Baker, Tree transductions and families of tree languages, Ph.D. Thesis, Harvard University,Report TR-9-73, 1973 (also:5th Theory of Computing, 200–206).

4. K. Čulik II andR. Cohen, LR-regular grammars—an extension of LR(k) grammars,JCSS 7 (1973), 66–96.

5. P. J. Downey, Tree transducers andETOL tree systems (abstract),Conference on Formal Languages, Automata and Development, Noordwijkerhout, Holland, 1975.

Cited by 127 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Functionality of compositions of top-down tree transducers is decidable;Information and Computation;2024-01

2. Attributed Tree Transducers for Partial Functions;Lecture Notes in Computer Science;2024

3. Transduction from trees to graphs through folding;Information and Computation;2023-12

4. Derivatives of Context-free Grammars with Lookahead;Journal of Information Processing;2023

5. Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer;Implementation and Application of Automata;2023