One-unambiguous regular languages
From MaRDI portal
Publication:5906893
DOI10.1006/INCO.1997.2688zbMATH Open0895.68146OpenAlexW2998389348MaRDI QIDQ5906893FDOQ5906893
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
Recommendations
Network design and communication in computer systems (68M10) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- Title not available (Why is that?)
- THE ABSTRACT THEORY OF AUTOMATA
- Title not available (Why is that?)
- Title not available (Why is that?)
- Derivatives of Regular Expressions
- Amounts of nondeterminism in finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bracketed context-free languages
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular expressions into finite automata
- Title not available (Why is that?)
- From regular expressions to deterministic automata
- Local languages and the Berry-Sethi algorithm
- From regular expressions to DFA's using compressed NFA's
- Deterministic regular languages
- Title not available (Why is that?)
- Ambiguity in Graphs and Expressions
- The validation of SGML content models
- The complexity of restricted regular expressions and the synthesis problem for finite automata
- Title not available (Why is that?)
Cited In (24)
- Title not available (Why is that?)
- 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
- Algorithms for checking intersection non-emptiness of regular expressions
- On the hierarchy of generalizations of one-unambiguous regular languages
- Generalized one-unambiguity
- Implication of regular expressions
- Regular languages of star height one
- The bottom-up position tree automaton and the father automaton
- Attribute grammars for unranked trees as a query language for structured documents
- The inclusion problem for regular expressions
- 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
- Deterministic regular languages
- Distributed XML design
- 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)
