Pages that link to "Item:Q2084735"
From MaRDI portal
The following pages link to Succinct representation for (non)deterministic finite automata (Q2084735):
Displaying 4 items.
- An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem (Q2754541) (← links)
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation (Q3034835) (← links)
- (Q4002039) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)