ACM Home Page
Please provide us with feedback. Feedback
Automata theory for XML researchers
Full text PdfPdf (639 KB)
Source ACM SIGMOD Record archive
Volume 31 ,  Issue 3  (September 2002) table of contents
COLUMN: Database principles table of contents
Pages: 39 - 46  
Year of Publication: 2002
ISSN:0163-5808
Author
Frank Neven  University of Limburg
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 76,   Citation Count: 34
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/601858.601869
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. V. Aho and J. D. Ullman. Translations on a context-free grammar. Inform. and Control, 19:439-475, 1971.
 
2
 
3
A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
 
4
A. Brüggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages, 2(1):81-106, 2000.
 
5
 
6
 
7
 
8
9
10
 
11
 
12
N. Klarlund, A. Moller, and M. I. Schwartzbach. The DSD schema language. In Proceedings of the 3th ACM SIGSOFT Workshop on Formal Methods in Software Practice (FMSP 2000), 2000.
 
13
D. Lee, M. Mani, and M. Murata. Reasoning about XML schema languages using formal language theor. Technical report, IBM Almaden Research Center, 2000. Log# 95071.
 
14
 
15
W. Martens and F. Neven. Typechecking of top-down uniform unranked tree transducers. Manuscript.
16
17
 
18
M. Murata. Relax. http://www.xml.gr.jp/relax/.
 
19
20
 
21
 
22
23
24
 
25
 
26
F. Neven and T. Schwentick. Automata- and logic-based pattern languages for tree-structured data. Unpublished, 2001.
 
27
 
28
29
 
30
C. Pair and A. Quere. Définition et etude des bilangages réguliers. Information and Control, 13(6):565-593, 1968.
31
 
32
33
 
34
35
 
36
M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 27(1):1-36, 1975.
37
38

CITED BY  34