Pages that link to "Item:Q2232264"
From MaRDI portal
The following pages link to Succinct representations for (non)deterministic finite automata (Q2232264):
Displaying 8 items.
- Generalized acceptance, succinctness and supernondeterministic finite automata. (Q1426171) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation (Q3034835) (← links)
- Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
- (Q4002039) (← links)
- (Q4952904) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)