The validation of SGML content models

DOI10.1016/S0895-7177(97)00025-3MaRDI QIDQ1370524zbMATH OpenFDO

Authors Anne Brüggemann-Klein, D. Wood

Publication date 26 October 1997

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

SGML document grammarsstandard generalized markup language

Mathematics Subject Classification ID

Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Deterministic regular languages
• SGML and XML document grammars and exceptions
• scientific article; zbMATH DE number 1117893
• One-unambiguous regular languages

Cites work

• scientific article; zbMATH DE number 3831300 (Why is no real title available?)
• scientific article; zbMATH DE number 3774848 (Why is no real title available?)
• scientific article; zbMATH DE number 194074 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• scientific article; zbMATH DE number 3298851 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• Ambiguity in Graphs and Expressions
• Bracketed context-free languages
• Derivatives of Regular Expressions
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• From regular expressions to deterministic automata
• Programming Techniques: Regular expression search algorithm
• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• The complexity of restricted regular expressions and the synthesis problem for finite automata

Cited in

(13)

• A characterization of Thompson digraphs.
• Evaluation of SGML-based information through fuzzy techniques
• One-unambiguous regular languages
• Algorithms for learning regular expressions from positive data
• Obtaining shorter regular expressions from finite-state automata
• SGML and XML document grammars and exceptions
• HTML validation of context-free languages
• One-unambiguous regular languages
• One-unambiguity of regular expressions with numeric occurrence indicators
• scientific article; zbMATH DE number 1117893 (Why is no real title available?)
• scientific article; zbMATH DE number 592267 (Why is no real title available?)
• Deterministic regular languages
• A Translation from the HTML DTD into a Regular Hedge Grammar

This page was built for publication: The validation of SGML content models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370524)