The validation of SGML content models

DOI10.1016/S0895-7177(97)00025-3zbMath0888.68122MaRDI QIDQ1370524

Derick Wood, Anne Brüggemann-Klein

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)

Related Items

One-unambiguity of regular expressions with numeric occurrence indicators ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ A characterization of Thompson digraphs. ⋮ One-unambiguous regular languages ⋮ One-unambiguous regular languages ⋮ Algorithms for learning regular expressions from positive data ⋮ SGML and XML document grammars and exceptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• The complexity of restricted regular expressions and the synthesis problem for finite automata
• Regular expressions into finite automata
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• Bracketed context-free languages
• THE ABSTRACT THEORY OF AUTOMATA
• FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
• Programming Techniques: Regular expression search algorithm
• Ambiguity in Graphs and Expressions
• Derivatives of Regular Expressions