Pages that link to "Item:Q1421476"
From MaRDI portal
The following pages link to A characterization of Thompson digraphs. (Q1421476):
Displaying 5 items.
- Series parallel digraphs with loops (Q372966) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- Benchmarking regular expression matching (Q6666809) (← links)