Pages that link to "Item:Q1391526"
From MaRDI portal
The following pages link to From regular expressions to DFA's using compressed NFA's (Q1391526):
Displaying 23 items.
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- An NSF proposal (Q815007) (← links)
- Efficient expansion of factored expressions (Q918712) (← links)
- Fast equation automaton computation (Q1018095) (← links)
- Algorithms for the compilation of regular expressions into PLAs (Q1098299) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata (Q1824394) (← links)
- Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
- Efficient testing and matching of deterministic regular expressions (Q2402370) (← links)
- Revisiting multiple pattern matching algorithms for multi-core architecture (Q2434550) (← links)
- Derivatives of Regular Expressions and an Application (Q2891325) (← links)
- SDFA: Series DFA for Memory-Efficient Regular Expression Matching (Q2914723) (← links)
- Two Algorithms For Languages Recognized By Graph Algebras (Q4792965) (← links)
- STACS 2005 (Q5710693) (← links)
- Derivatives and Finite Automata of Expressions in Star Normal Form (Q5739000) (← links)
- One-unambiguous regular languages (Q5906297) (← links)
- One-unambiguous regular languages (Q5906893) (← links)
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)
- On algebraic array theories (Q6192058) (← links)
