scientific article; zbMATH DE number 1452984
From MaRDI portal
Publication:4955255
Recommendations
- Efficient implementation of regular languages using reversed alternating finite automata
- Descriptional Complexity of Operations on Alternating and Boolean Automata
- NFA-to-DFA trade-off for regular operations
- From regular expressions to DFA's using compressed NFA's
- On the State Complexity of Operations on Two-Way Finite Automata
Cited in
(1)
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 Q4955255)