Pages that link to "Item:Q982670"
From MaRDI portal
The following pages link to Succinctness of regular expressions with interleaving, intersection and counting (Q982670):
Displaying 16 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Automata for regular expressions with shuffle (Q1706150) (← links)
- Intersection of \(-\omega \)-regular expressions (Q2058685) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- Derivatives and partial derivatives for regular shuffle expressions (Q2424692) (← links)
- Derivatives for Regular Shuffle Expressions (Q2799179) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- Position Automaton Construction for Regular Expressions with Intersection (Q2817375) (← links)
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (Q2829969) (← links)
- Succinctness of the Complement and Intersection of Regular Expressions (Q2946652) (← links)
- Succinctness of the complement and intersection of regular expressions (Q4910730) (← links)
- PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA (Q5168416) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- Games for succinctness of regular expressions (Q6649529) (← links)