Pages that link to "Item:Q3165960"
From MaRDI portal
The following pages link to An Optimal Construction of Finite Automata from Regular Expressions (Q3165960):
Displaying 13 items.
- Series parallel digraphs with loops (Q372966) (← links)
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- (Q3004324) (← links)
- Construction of Tree Automata from Regular Expressions (Q3533035) (← links)
- From Regular Weighted Expressions to Finite Automata (Q3559799) (← links)
- (Q4489994) (← links)
- (Q4793129) (← links)
- (Q4967184) (← links)
- (Q4994710) (← links)