XML Grammars

Authors:
Jean Berstel;Luc Boasson
Affiliations:
-;-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 4
Cited 5

Parenthesis Grammars

Journal of the ACM (JACM)
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Bracketed context-free languages

Journal of Computer and System Sciences

Foundations of Fast Communication via XML

Annals of Software Engineering
Learning XML Grammars

MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Balanced Grammars and Their Languages

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
On inference of XML schema with the knowledge of an obsolete one

ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
One-Visit Caterpillar Tree Automata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML documents are described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties of this family of grammars. We show that an XML-language basically has a unique XML-grammar. We give two characterizations of languages generated by XML-grammars, one is set-theoretic, the other is by a kind of saturation property. We investigate decidability problems and prove that some properties that are undecidable for general context-free languages become decidable for XML-languages.