Pages that link to "Item:Q3532998"
From MaRDI portal
The following pages link to On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998):
Displaying 9 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Weighted automata are compact and actively learnable (Q2032169) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (Q3167496) (← links)
- A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958) (← links)
- (Q4036599) (← links)
- (Q4708581) (← links)
- (Q5004969) (← links)