Automata and Logics for Unranked and Unordered Trees-Reference-Cited by-同舟云学术

Automata and Logics for Unranked and Unordered Trees

Published:2005 Issue: Volume: Page:500-515
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Boneva Iovka,Talbot Jean-Marc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-32033-3_36.pdf

Reference20 articles.

1. Lecture Notes in Computer Science;J. Carme,2004

2. Electronic Notes in Theoretical Computer Science;T. Colcombet,2002

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1997), Available on: http://www.grappa.univ-lille3.fr/tata (release October 1, 2002)

4. Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. IC 85(1), 12–75 (1990)

5. Courcelle, B.: The monadic second order logic of graphs VI: on several representations of graphs by relational structures. Discrete Applied Mathematics 54(2-3), 117–149 (1994)

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

1. Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting;Logic, Language, Information, and Computation;2022

2. Logics for Unordered Trees with Data Constraints on Siblings;Language and Automata Theory and Applications;2015

3. Schemas for Unordered XML on a DIME;Theory of Computing Systems;2014-12-16

4. Finite Automata on Unranked and Unordered DAGs;Developments in Language Theory;2007

5. Presburger Modal Logic Is PSPACE-Complete;Automated Reasoning;2006