Deterministic Automata on Unranked Trees-Reference-Cited by-同舟云学术

Deterministic Automata on Unranked Trees

Published:2005 Issue: Volume: Page:68-79
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Cristau Julien,Löding Christof,Thomas Wolfgang

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11537311_7.pdf

Reference14 articles.

1. Berstel, J., Boasson, L.: Formal properties of XML grammars and languages. Acta Informatica 38, 649–671 (2002)

2. Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)

3. Brüggemann-Klein, A., Wood, D., Murata, M.: Regular tree and regular hedge languages over unranked alphabets: Version 1. unfinished technical report (April 2001), http://citeseer.ist.psu.edu/451005.html

4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Unpublished electronic book (1997), http://www.grappa.univ-lille3.fr/tata

5. Eilenberg, S.: Automata, languages, and machines, vol. A. Academic Press, London (1974)

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

1. Checking in polynomial time whether or not a regular tree language is deterministic top-down;Information Processing Letters;2024-02

2. A Robust Theory of Series Parallel Graphs;Proceedings of the ACM on Programming Languages;2023-01-09

3. Improving IDE code inspections with tree automata;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07

4. Deciding Top-Down Determinism of Regular Tree Languages;Fundamentals of Computation Theory;2021

5. XML Types;Encyclopedia of Database Systems;2018