scientific article; zbMATH DE number 5309908
From MaRDI portal
Publication:3517095
Recommendations
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- A family of NFA's which need 2ⁿ- deterministic states
- Reducing NFAs by invariant equivalences.
- BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
- NFAs with and without -transitions
- Brute force determinization of NFAs by means of state covers
- On NFA reductions
- Reducing the size of NFAs by using equivalences and preorders
- scientific article; zbMATH DE number 1502106
- Nondeterministic state complexity for suffix-free regular languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517095)