Properties of Visibly Pushdown Transducers-Reference-Cited by-同舟云学术

Properties of Visibly Pushdown Transducers

Published:2010 Issue: Volume: Page:355-367
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2010
language:
Short-container-title:

Author:

Filiot Emmanuel,Raskin Jean-François,Reynier Pierre-Alain,Servais Frédéric,Talbot Jean-Marc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15155-2_32.pdf

Reference24 articles.

1. Lecture Notes in Computer Science;R. Alur,2007

2. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211 (2004)

3. Béal, M.-P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. TCS 292(1), 45–63 (2003)

4. Blattner, M., Head, T.: Single-valued a-transducers. JCSS 15(3), 310–327 (1977)

5. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata

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

1. Colored nested words;Formal Methods in System Design;2021-11

2. Two-Way Parikh Automata with a Visibly Pushdown Stack;Lecture Notes in Computer Science;2019

3. Visibly pushdown transducers;Journal of Computer and System Sciences;2018-11

4. Visibly Pushdown Automata and Transducers with Counters;Fundamenta Informaticae;2016-12-24

5. Efficient determinization of visibly and height-deterministic pushdown automata;Computer Languages, Systems & Structures;2016-11