One-unambiguous regular languages

DOI10.1006/INCO.1997.2688MaRDI QIDQ5906893zbMATH OpenOpenAlexFDO

Authors Anne Brüggemann-Klein, D. Wood

Publication date 8 September 1998

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/395b69ba6c2433f0529a47f710502cf60122dc52

zbMATH Keywords

standard generalized markup languagetextual markup systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• One-unambiguous regular languages
• Deterministic regular languages
• Generalized one-unambiguity
• The validation of SGML content models

Cites work

• scientific article; zbMATH DE number 5344975 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 592267 (Why is no real title available?)
• scientific article; zbMATH DE number 1117893 (Why is no real title available?)
• scientific article; zbMATH DE number 1117894 (Why is no real title available?)
• scientific article; zbMATH DE number 1142311 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 798342 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• Ambiguity in Graphs and Expressions
• Amounts of nondeterminism in finite automata
• Bracketed context-free languages
• Derivatives of Regular Expressions
• Deterministic regular languages
• Fast Pattern Matching in Strings
• From regular expressions to DFA's using compressed NFA's
• From regular expressions to deterministic automata
• Local languages and the Berry-Sethi algorithm
• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• The complexity of restricted regular expressions and the synthesis problem for finite automata
• The validation of SGML content models

Cited in

(24)

• scientific article; zbMATH DE number 7561705 (Why is no real title available?)
• Formalising and implementing Boost POSIX regular expression matching
• Implementation of State Elimination Using Heuristics
• On the hierarchy of block deterministic languages
• Deciding determinism of unary languages
• Automata for XML -- a survey
• On the hierarchy of generalizations of one-unambiguous regular languages
• Algorithms for checking intersection non-emptiness of regular expressions
• Implication of regular expressions
• Generalized one-unambiguity
• Regular languages of star height one
• Attribute grammars for unranked trees as a query language for structured documents
• The inclusion problem for regular expressions
• The bottom-up position tree automaton and the father automaton
• One-unambiguity of regular expressions with numeric occurrence indicators
• The complexity of SORE-definability problems
• How to settle the ReDoS problem: back to the classical automata theory
• Finite automata with undirected state graphs
• From finite automata to regular expressions and back -- a summary on descriptional complexity
• Backward type inference for XML queries
• Unary Languages Recognized by Two-Way One-Counter Automata
• Distributed XML design
• Deterministic regular languages
• Generalizations of 1-deterministic regular languages

This page was built for publication: One-unambiguous regular languages

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