Residual Finite Tree Automata
Tree automata based algorithms are essential in many fields in computer science such as verification, specification, program analysis. They become also essential for databases with the development of standards such as XML. In this paper, we define new classes of non deterministic tree automata, namely residual finite tree automata (RFTA). In the bottom-up case, we obtain a new characterization of regular tree languages. In the top-down case, we obtain a subclass of regular tree languages which contains the class of languages recognized by deterministic top-down tree automata. RFTA also come with the property of existence of canonical non deterministic tree automata.
Unable to display preview. Download preview PDF.
- [CDG+97]_H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.Google Scholar
- [CGL+03]_J. Carme, R. Gilleron, A. Lemay, A. Terlutte, and M. Tommasi. Residual finite tree automata. Technical report, GRAPPA, 2003.Google Scholar
- [DLT01]F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using rfsa. In ALT 2001, number 2225 in Lecture Notes in Artificial Intelligence. Springer Verlag, 2001.Google Scholar
- [Fer02]Henning Fernau. Learning tree languages from text. In Proc. 15th Annual Conference on Computational Learning Theory, COLT 2002, pages 153–168, 2002.Google Scholar
- [GS84]F. Gécseg and M. Steinby. Tree Automata. Akademiai Kiado, 1984.Google Scholar
- [GS96]F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1–68. Springer Verlag, 1996.Google Scholar
- [LPH00]Ling Liu, Calton Pu, and Wei Han. XWRAP: An XML-enabled wrapper construction system for web information sources. In ICDE, pages 611–621, 2000.Google Scholar
- [MLM01]M. Murata, D. Lee, and M. Mani. “Taxonomy of XML Schema Languages using Formal Language Theory”. In Extreme Markup Languages, Montreal, Canada, 2001.Google Scholar
- [Nev02]F. Neven. Automata, xml and logic. In Proceedings of CSL, pages 2–26, 2002.Google Scholar
- [Tha73]J.W. Thatcher. Tree automata: an informal survey. In A.V. Aho, editor, Currents in the theory of computing, pages 143–178. Prentice Hall, 1973.Google Scholar
- [Tho84]Wolfgang Thomas. Logical aspects in the study of tree languages. In Proceedings of the 9th International Colloquium on Trees in Algebra and Programming, CAAP’ 84, pages 31–50, 1984.Google Scholar