Pages that link to "Item:Q3533026"
From MaRDI portal
The following pages link to Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026):
Displaying 5 items.
- More concise representation of regular languages by automata and regular expressions (Q963066) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- Implementation of State Elimination Using Heuristics (Q3637355) (← links)
- Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
