The following pages link to (Q4910730):
Displaying 17 items.
- Series parallel digraphs with loops (Q372966) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Succinctness of pattern-based schema languages for XML (Q532368) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- Natural strategic ability (Q2289013) (← links)
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (Q2829969) (← links)
- Functional Specification of Hardware via Temporal Logic (Q3176382) (← links)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026) (← links)
- Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
- Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
