The validation of SGML content models
From MaRDI portal
Publication:1370524
DOI10.1016/S0895-7177(97)00025-3zbMATH Open0888.68122MaRDI QIDQ1370524FDOQ1370524
Authors: Anne Brüggemann-Klein, D. Wood 
Publication date: 26 October 1997
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Recommendations
Cites Work
- THE ABSTRACT THEORY OF AUTOMATA
- Title not available (Why is that?)
- Derivatives of Regular Expressions
- Title not available (Why is that?)
- Bracketed context-free languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming Techniques: Regular expression search algorithm
- Regular expressions into finite automata
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
- From regular expressions to deterministic automata
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Title not available (Why is that?)
- Ambiguity in Graphs and Expressions
- The complexity of restricted regular expressions and the synthesis problem for finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- A characterization of Thompson digraphs.
- One-unambiguous regular languages
- Evaluation of SGML-based information through fuzzy techniques
- Algorithms for learning regular expressions from positive data
- SGML and XML document grammars and exceptions
- Obtaining shorter regular expressions from finite-state automata
- HTML validation of context-free languages
- One-unambiguous regular languages
- One-unambiguity of regular expressions with numeric occurrence indicators
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
