Pages that link to "Item:Q4944659"
From MaRDI portal
The following pages link to From regular expressions to finite automata<sup>∗</sup> (Q4944659):
Displaying 18 items.
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- (Q3004324) (← links)
- From Sequential Extended Regular Expressions to NFA with Symbolic Labels (Q3073625) (← links)
- Construction of Tree Automata from Regular Expressions (Q3533035) (← links)
- From Regular Weighted Expressions to Finite Automata (Q3559799) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Series-Parallel Automata and Short Regular Expressions (Q3633925) (← links)
- (Q4489994) (← links)
- (Q4793129) (← links)
- Glushkov Construction For Series: The Non Commutative Case (Q4807698) (← links)
- (Q4967184) (← links)
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA (Q5292270) (← links)
- VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION (Q5696953) (← links)