One-unambiguous regular languages

DOI10.1006/inco.1997.2688zbMath0895.68146OpenAlexW2998389348MaRDI QIDQ5906893

Derick Wood, Anne Brüggemann-Klein

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)

Related Items

How to settle the ReDoS problem: back to the classical automata theory, Automata for XML -- a survey, Backward type inference for XML queries, On the Hierarchy of Block Deterministic Languages, Deciding determinism of unary languages, Implication of regular expressions, Formalising and implementing Boost POSIX regular expression matching, Distributed XML design, Generalizations of 1-deterministic regular languages, The inclusion problem for regular expressions, Finite automata with undirected state graphs, Attribute grammars for unranked trees as a query language for structured documents, From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity, Unnamed Item, Implementation of State Elimination Using Heuristics, The Bottom-Up Position Tree Automaton and the Father Automaton, On the hierarchy of generalizations of one-unambiguous regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Local languages and the Berry-Sethi algorithm
• The complexity of restricted regular expressions and the synthesis problem for finite automata
• Amounts of nondeterminism in finite automata
• Regular expressions into finite automata
• The validation of SGML content models
• From regular expressions to DFA's using compressed NFA's
• Bracketed context-free languages
• THE ABSTRACT THEORY OF AUTOMATA
• Fast Pattern Matching in Strings
• Deterministic regular languages
• Ambiguity in Graphs and Expressions
• Derivatives of Regular Expressions