Context-free grammars and XML languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4036 LNCS, Issue , 2006, Pages 108-119

  Bertoni, Alberto ^a   Choffrut, Christian ^b   Palano, Beatrice ^a  

^a UNIVERSITY OF MILAN   (Italy)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; CONTEXT FREE GRAMMARS; FORMAL LANGUAGES; INFORMATION TECHNOLOGY; PROBLEM SOLVING;

DETERMINISTIC LANGUAGE; DYCK LANGUAGE; PARENTHESES;

XML;

EID: 33746254893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779148_11     Document Type: Conference Paper

References (8)

1. J. Berstel and L. Boasson. Formal properties of XML grammars and languages. Acta Inf., 38:649-671, 2002.
2. R. Book, S. Even, S. Greibach and G. Ott. Ambiguity in graphs and expressions. IEEE Trans. Comput., C-20:149-153, 1971.
3. J. Hopcroft and J. Ullman, Formal Languages and their relation to automata. Addison-Wesley, 1969.
4. D.E. Knuth. A characterization of parenthesis languages. Inf. Cont., 11:269-289, 1967.
5. M. Lohrey. Word problems and membership problems on compressed words. Preprint,2004. http://wvw.informatik.uni-stuttgart.de/fmi/ti/mitarbeiter/Lohrey.
6. G. Senizerguen. L(A)=L(B)? decidability results from complete formal systems. Theor. Comp, Sci., 251:1-166, 2001.
7. R.E. Stearns. A regularity test for pushdown machines. Inf. Cont., 11:323-340, 1967.
8. W3C Recommendation REC-xml-19980210. Extensible Markup Language (XML) 1.0, 10 February 1998. http://www.w3.org/TR/REC-XML.