The following pages link to One-unambiguous regular languages (Q5906893):
Displaying 24 items.
- Implication of regular expressions (Q452941) (← links)
- Distributed XML design (Q657904) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- The validation of SGML content models (Q1370524) (← links)
- The inclusion problem for regular expressions (Q1757837) (← links)
- Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- Formalising and implementing Boost POSIX regular expression matching (Q2220787) (← links)
- On the hierarchy of generalizations of one-unambiguous regular languages (Q2357109) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- On the Hierarchy of Block Deterministic Languages (Q2947409) (← links)
- Unary Languages Recognized by Two-Way One-Counter Automata (Q3192259) (← links)
- Regular languages of star height one (Q3339308) (← links)
- Implementation of State Elimination Using Heuristics (Q3637355) (← links)
- (Q5092424) (← links)
- (Q5111236) (← links)
- The Bottom-Up Position Tree Automaton and the Father Automaton (Q5859662) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- Finite automata with undirected state graphs (Q5918649) (← links)
- Algorithms for checking intersection non-emptiness of regular expressions (Q6605358) (← links)
