The following pages link to One-unambiguous regular languages (Q5906297):
Displaying 37 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking (Q391129) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Deciding determinism of regular languages (Q493651) (← links)
- Succinctness of pattern-based schema languages for XML (Q532368) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Algorithms for learning regular expressions from positive data (Q1013092) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- A similarity between probabilistic tree languages: Application to XML document families. (Q1400519) (← links)
- A theoretical framework for cardinality-based feature models: the semantics and computational aspects (Q1647962) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- SGML and XML document grammars and exceptions (Q1854453) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Definability by Weakly Deterministic Regular Expressions with Counters is Decidable (Q2946353) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- Inferring Deterministic Regular Expression with Unorder (Q3297778) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- Schema-Guided Induction of Monadic Queries (Q3530183) (← links)
- Game Quantification Patterns (Q3601804) (← links)
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata (Q5042238) (← links)
- Weak Inclusion for XML Types (Q5200049) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596) (← links)
- Derivatives and Finite Automata of Expressions in Star Normal Form (Q5739000) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
