The following pages link to One-unambiguous regular languages (Q5906297):
Displayed 15 items.
- Succinctness of pattern-based schema languages for XML (Q532368) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← 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)
- SGML and XML document grammars and exceptions (Q1854453) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- Schema-Guided Induction of Monadic Queries (Q3530183) (← links)
- Game Quantification Patterns (Q3601804) (← links)
- Weak Inclusion for XML Types (Q5200049) (← links)
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
