Tree Automata and Term Rewrite Systems-Reference-Cited by-同舟云学术

Tree Automata and Term Rewrite Systems

Published:2000 Issue: Volume: Page:27-30
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Tison Sophie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10721975_2

Reference27 articles.

1. Brainerd, W.S.: Semi-thue systems and representations of trees. In: Proc. 10th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 240–244 (1969)

2. Brainerd, W.S.: Tree generating regular systems. Information and Control 14(2), 217–231 (1969)

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on: http://l3ux02.univ-lille3.fr/tata

4. Coquide, J.L., Dauchet, M., Gilleron, R., Vagvolgyi, S.: Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Theorical Computer Science 127, 69–98 (1994)

5. Lecture Notes in Computer Science;H. Comon,1994

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

1. Tree automata with equality constraints modulo equational theories;The Journal of Logic and Algebraic Programming;2008-04

2. Tree Automata with Equality Constraints Modulo Equational Theories;Automated Reasoning;2006

3. Deleting string rewriting systems preserve regularity;Theoretical Computer Science;2004-11

4. Deleting String Rewriting Systems Preserve Regularity;Developments in Language Theory;2003

5. Approximations for Strategies and Termination;Electronic Notes in Theoretical Computer Science;2002-12