Pages that link to "Item:Q2946652"
From MaRDI portal
The following pages link to Succinctness of the Complement and Intersection of Regular Expressions (Q2946652):
Displaying 21 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Intersection of \(-\omega \)-regular expressions (Q2058685) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Complexity of regex crosswords (Q2278278) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- Negation-closure for JSON schema (Q2697439) (← links)
- Extended Regular Expressions: Succinctness and Decidability (Q3113715) (← links)
- (Q4382097) (← links)
- Succinctness of the complement and intersection of regular expressions (Q4910730) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- Expressive capacity of subregular expressions (Q5223616) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311160) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Games for succinctness of regular expressions (Q6649529) (← links)
