Implicit structures to implement NFA's from regular expressions
From MaRDI portal
Recommendations
- EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
- Constructing NFAs by optimal use of positions in regular expressions
- From regular expressions to DFA's using compressed NFA's
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
- Follow automata.
Cited in
(2)
This page was built for publication: Implicit structures to implement NFA's from regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540959)