Pages that link to "Item:Q1280234"
From MaRDI portal
The following pages link to The passing of a rational expression to a nondeterministic finite automaton (Q1280234):
Displaying 15 items.
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- Local languages and the Berry-Sethi algorithm (Q672153) (← links)
- From regular expressions to smaller NFAs (Q719325) (← links)
- Fast equation automaton computation (Q1018095) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
- Construction of tree automata from regular expressions (Q3095043) (← links)
- Efficient weighted expressions conversion (Q3515463) (← links)
- Enumerated BSP Automata (Q4686652) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- Weak Inclusion for XML Types (Q5200049) (← links)
- Subset construction complexity for homogeneous automata, position automata and ZPC-structures (Q5958722) (← links)
- Algorithms for checking intersection non-emptiness of regular expressions (Q6605358) (← links)
