Pages that link to "Item:Q2641868"
From MaRDI portal
The following pages link to Minimizing nfa's and regular expressions (Q2641868):
Displaying 18 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- Aggregation-based minimization of finite state automata (Q2035006) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Minimisation of automata (Q2074212) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- On the complexity of determinizing monitors (Q2399244) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- On the Inference of Finite State Automata from Positive and Negative Data (Q2963595) (← links)
- Büchi Automata Can Have Smaller Quotients (Q3012925) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- (Q5092323) (← links)